Given this recurrence relation T(n) = n*n + 2*T(n/3), and us…
Given this recurrence relation T(n) = n*n + 2*T(n/3), and using the recursion tree method, answer the following: A- What is the number of nodes of the recursion tree at level i = 6? B- What is the height of the recursion tree after it is fully extracted?