(Solved): Question 3: (20 points) (Divide and Conquer) Solve the recurrence relation for \( T(\mathrm{n}) \) ...

Question 3: (20 points) (Divide and Conquer) Solve the recurrence relation for \( T(\mathrm{n}) \), and also find the big-Oh complexity of \( \mathrm{T}(\mathrm{n}) \) : \( T(n)=2 T(\sqrt{n})+b\left(\log _{2} n\right) \) for \( n>2 \) \[ \mathrm{T}(2)=\mathrm{d} \] Here, \( d \) and \( b \) are constants.