Question & Answer: Using the Recursion-trees & Iteration method, give a good asympto…..

Using the Recursion-trees & Iteration method, give a good asymptotic upper bound on the recurrence below. Assume T(n) is constant for small n.

T(n) = 3T(n/3) + n²