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 case, show your work. (a) T(n) T(n 4) Cn if n > 1, and T(n) C otherwise (b) T(n) 3T(n 2) 1 if n >1, and T(n) 3 otherwise (c) T(n) = T(n-1) + 2n if n > 1, and T(1) = 3 (d) T(n) = T(n1/2) + 1 if n > 2 , and T(n) = 0 otherwise