4. For each of the following recurrences, solve the recurrence relation using the Master Theorem and give an expression for the runtime of T(n) accordingly. Justify your answer. (1) T(n) 9T(n/3) + n² (2) T(n) 64 T(n/4) + O(n) (3) T(n) 16T(n/4) + n