Please do 3 of them.. Try to help me out please

(10 Points) Find the complexity of T(n) = 3T(n/3) + n using the recursion tree method (expand the T(n) into sub function calls and count additional costs). (10 Points) Find the complexity of T(n) = 4*T(n/2) + 1 using master theorem. (10 Points) Find the complexity of T(n) = 4*T(n/3) + Vn using master theorem