THAT IS ALL THE QUESTION, I BELIEVE THIS WILL GIVE YOU AN IDEA OF WHAT I AM LOOKING FOR IN SUBSTITUTION METHOD.

SO JUST ANSWER QUESTION (4F) ONLY

USING THE SUBSTITUTION METHOD FOR ALGORITHMS.

PLEASE SHOW DETAILED STEPS

THANK YOU.

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) = O(n) (b) (1 point) True or False (you don't need to show why): cnB = (n), B>1.c>0 (c) (1 point) True or False (you don't need to show why): cnp dn = O(nb), B>1,c>0 (d) (1 point) From part (a), what is the value of 8? (e) (5 points) Use substitution; show that the hypothesis T(k)