Problem 2 Give asymptotic upper bounds for T(n) satisfying the following recurrences. Make your bounds as tight as possible. A correct answer will gain full credits. It is not necessary to show your work BUT, if your answer was wrong, showing your work steps may gain you partial credits. If showing your work, you may use theorems shown in class or can prove results from scratch (a) T(1) = 1:T(n) = T (3n/4) 1 for n > 1 . Assuming n is a power o (b) T(1) 1: T(n)-5T(n/4) + n2 for n > 1. Assuming n is a power of 4. (c) T(1) 1;T(n) 8T(n/2)+n3 for n>1. Assuming n is a power of 2. (d) T( 1;T(n) 4T(n/3) + n for 1. Assuming n is a power of 3. (e) T(1)-1;T(n)-2T(n/3) + n for n > 1. Assuming n is a power of 3.