How can i solve a recursion equation with square root using recursion tree method?

**T(n) = sqrt(2)T(n/2) + sqrt(n)** 

I am trying to solve this question by recursion tree method, do we have any way in which we can draw a recursion tree for this eqn.

I just don’t want to use master or extended master theorem