Problem 1. (15p) Solve the following recurrence relations. Unless specifed otherwise, you may assume T(n) =0(1) for n-0, 1, 2 or any other small constant. Reminder: There are two main ways to solve recurrence relations. (1) Guess eract solution using iterative substitution or guess asgmptotic class of solution. Prove using induction that your guess is correct. Note that for proving an asymptotic class T(n) E (f(n)) you need to prove two inequalities. (2) Use Master theorem. Verify if it really applies. Indicate the case your problem fall into. 1.1 (4p) T(n)-37 (3) + v 1.2 (4p) T(n) = T(n-1) + 2 * n, n > 1, T(1) = 0 1.3 (3p)T(n) = 3T(n-1), n > i, T(1) = 4 1.4 (4p) T(n)2)n log n)