I have a recurrence relation and trying to use master theorem to solve it. The recurrence relation is:$T(n) = 3T(n/5) + n^{0.5}$Can I use the master theorem in that relation? If so, can I say that $T(n)$ is $(n^{0.5})$?
The use of master theorem appriopriately
algorithms;time complexity;recurrence relation;recursion;master theorem