3. (3 pts) Let T(n) = 5 for n = 1, and for all n recurrence using the mathematical induction method. (i.e., You need to guess a solution - explicit solution of T(n) (you need to specify all coefficients, do not use O, Q, or ), and assume that the guess is true for n-k. Then prove that it is also true for n-k+2. You also need to prove that your guess is true for the base case. 2, T(n) = T(n-2) 5n + 7, Solve this