
this is the recurse formula:
T(n)=9T(n/27)+(n*lgn)^1/2
I started with a=9,b=27 and f(n)=(n*lgn)^1/2 for using the master method by "n^logb(a)"
And if so n^log27(9)==n^(2/3) but i dont understand how to play with the (n*lgn)^1/2 . I think that the (n*lgn)^1/2 is bigger than n^(2/3) but I'm sure ...