Solve T(n) = 3T(n/2) + (n) 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 or they should be clear from your answer

6. (10 points] Solve T(n) = 3T (n/2) + (n) 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 - or they should be clear from your answer. Tree depth: each subproblem size at depth d: number of subproblemsodes at depth d: workload per subproblemode at depth d: (total) workload at depth d: T(n) =