Upper and Lower bound of recursive functions

[webdev]

Hi! I have some recursive functions to solve... 1) T(n)=5T(2n/3) + n^3 (lgn)^2 2)T(n)= 2T(n/8)+ n^1/3 3)T(n)= 2T(n^1/2)+n It's the first time that I'm dealing with those kind of things,so I would appreciate some help. I used the Master Theorem on the second function and the result is ...