1. (20 pts total) Solve the following recurrence relations using any of the following meth- ods: unrolling, tail recursion, recurrence tree (include tree diagram), or expansion. Each each case, show your work. (a) T(n) = T(n-2) + C n if n 1, and T(n)-C otherwise (b) T (n)-31 (n-1) + 1 if n > 1, and T(1) 3 (c) T(n) T(n-1) +3" if n > 1, and T(1)-3 (d) T (n)-T(n1/4) + 1 if n > 2 , and T( n)- 0 otherwise