## Recursion Trees with Recurrences

Hello

I am asked to find the Recurrece of the following algorithm

T(n) = sqrt(n) T (sqrt[n]) + 100n

Now, usually I would use substitution to solve this. But It has been recommended to me that I should use recursion trees.

However, all the example I deal with do not have a the same form of T(n) by multiplied by a factor of n. usually it is of the form T(n)=aT(n)+ f(n).

So how could I start this?