Using the Master theorem or recursion tree methods, solve the following recurrence relations and give bound for each of them.

a) T(n) = 9T(n/3) + 3n 2 + 12n 4, where n 1.

b) T(n) = T(n 1) + n c , where n 1 and c > 0

c) T(n) = T( n) + 1, where n > b and T(b) = 2.