Prepare your solutions in LaTeX and submit in Canvas, like you would do for a regular assignment, but remember not to put your name on your paper!
Solve the following recurrence exactly (in other words, do not use asymptotic notation), where you may assume n is a power of 4. Show your derivation and then prove that your answer is correct.
T(n) = 5T(n/4) + n; T(1) = 1
Textbook, Problem 22.2, recurrences 1, 4, and 6. For each recurrence, first state whether it can be solved using the Master Theorem, and if it can then use that. Otherwise, use the Akra-Bazzi formula.