Please have a unique answer not already on chegg

Problem 3. (15 points) Solve the following recurrence equations and give the solution in 0 notation; show all the steps in the derivation of the solution to get full credit. Assume T(n) is (1) for sufficiently small n. DO NOT use the Master Theorem 5.6 of the text book. (a) T(n) = 2T(n-1) + 3n2 (b) T(n) = 9T(n/2) +n assuming n is a power of 2. Problem 3. (15 points) Solve the following recurrence equations and give the solution in 0 notation; show all the steps in the derivation of the solution to get full credit. Assume T(n) is (1) for sufficiently small n. DO NOT use the Master Theorem 5.6 of the text book. (a) T(n) = 2T(n-1) + 3n2 (b) T(n) = 9T(n/2) +n assuming n is a power of 2