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) = (n) (b) (1 point) True or False (you don't need to show why): en" = (n), 8 > 1.c > 0 (c) (1 point) True or False (you don't need to show why): cn- dn = O(n). 8 > 1,0 > 0 (d) (1 point) From part (a), what is the value of 8? (e) (5 points) Use substitution; show that the hypothesis T() Scho fails. (1) (8 points) Use substitution; subtract a lower order term, ie, use the hypothesis T() Sci- I only need help with part D & Part E That's It Thank you