(Solved): Problem 7. Use the recursion tree method to solve the following recurrence relation. 2T(n/3) +n ...

Problem 7. Use the recursion tree method to solve the following recurrence relation. 2T(n/3) +n² n>4 n < 4. T(n) = = | ¹ By "solve" we mean compute an expression for T(n) and write your answer in the form T(n) = (f(n)) for some closed-form function f. Show all your calculations. You do not need to worry about rounding errors in your analysis.