4. Solve the recurrence T(n) = 4T(n/3) +n. (a) (4 points) Justify and use the master method; your answer will look like T(n) = e(n) (b) (1 point) True or False (you don't need to show why): cn = O(n), B>1,c> 0 () (1 point) True or False (you don't need to show why): cnp - dn = O(n), 8 >1,c>0 (d) (1 point) From part (a), what is the value of B? (e) (5 points) Use substitution; show that the hypothesis T(k)