(basic) Solve T(n) = 4T(n/2) + (n^2) using the recursion tree method. Cleary state the tree depth, each subproblem size at depth d, the number of subproblemsodes at depth d, workload per subproblemode at depth d, (total) workload at depth d.

Please state everything that is asked for or your answer will be downvoted.

(basic) Solve T(n)-4T(n/2) + (n2) using the recursion tree method. Cleary state the d, workload per subproblemode at depth d, (total) workload at depth d