Adapted from Problem 2.4.1 in The Design and Analysis of Algorithms Solve the following recurrence relations a. r(n) = x (n _ 1) + 5 for n > 1 and x (1) = 4. b.r(n) = 2r (n-I) + 8 for n > 0 and r(0) = 6. c2(n)-2(n-1) + n3 for n > 0 and (0) 4 d. x (n) (5) + n for n > 1 and x (1-9. Solve for n = 4k. e, x(n) =r() + 6 for n > 1 and x (1) = 4. Solve for n=3k