1 (Exercise 4.2-1) Use a recursion tree to determine a good asymptotic upper bound on the recurrence T(n)=3T(n/2)+n. Use the mathematical induction to prove your answer. 2 (Exercise 4.2-3) Draw the recursion tree for T(n)=4T(n/2)+cn, where c is a constant, and provide a tight asymptotic bound on its solution. Prove your bound by mathematical induction