$($a$)$ Solve the following recurrence relations using the Master's method:

$($i$)T(n)=2T(\frac{n}{4})+\sqrt[\phantom{2}]{n}$

$($ii$)T(n)-3T(\frac{n}{3})+nlogn$

Marks$]$

$($b$)$ Analyze the computational complexity of the following code and discuss its efficiency.