Remember that these problems are for individual work only (no collaboration).
Solve the following recurrence exactly (in other words, do not use asymptotic notation), where you may assume n is a power of 3. Show your derivation and then prove that your answer is correct.
T(n) = 2T(n/3) + n; T(1) = 1
Textbook, Problem 22.2, recurrences 2, 3, 5, and 7. 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.
Textbook, Problem 10.22
Textbook, Problem 10.25