Adapted from Problem 2.4.1 in The Design and Analysis of Algorithms Solve the following recurrence relations. a. 2 (n) = *(n-1)+6 for n > 1 and 2 (1)=5. b. 2 (n) = 4.c (n-1) +8 for n >0 and 2 (0) = 3. c. * (n) = x(n-1)+n2 for n > 0 and 2 (0) = 4. d. 2 (n) = 2(a) +n for n > 1 and 2 (1) = 6. Solve for n = 4k. e. z (n) = 1 and 2 (1) = 9. Solve for n = 7k