Find the closed form for each T(n) given as a recurrence: 1. n = 1 T(n) (1) T(n 1) + 2 n > 2 : n = 1 n > 1 2 T(n) = { : (2) T( 1) + 4n 3 3. { 1 T') (3) 2T ( 1) 1 n > 2 : 4. = 1 T(m) = { (4) 2T ( - 1) + - 1 >1 : 5. Let n = 2m 1. Rewrite your answer of the previous problem as a function of n. 2