Question 1: or recursion tree methods, solve the following recurence relations and give O bound for each of (8 marks) (From the DPU textbook, Exercise 2.5) Using the Master theorem them. a) T(n) = 9T(n/3) + 3n2 + 12n 4, where n > 1. b) T(n) = T(n 1) + n, where n > 1 and c > 0 c) T(n) = T(Vn) + 1, where n > b and T(b) = 2