4. (30 pts) Recurrence equations: Show your work for the following problems. a. Use the Master's Method to determine the runtime of T(n) = 4T 6) + (n) b. Use your solution from a) as your guess, then solve using the substitution method c. Draw a recursion tree for this recurrence, and prove* how deep the tree is i.e. the number of levels). Then, argue that the runtime matches the answers from the two above