1. (25 pts) Solve the following recurrence relations. For each case, show your work. (a) T(n) = T(n-1) + cn if n 1, and T(1) = c, (b) T(n) = 2T(n-1) + 1 if n 1, and T(1) = 3, (c) T(n)-T(n/2) + 3 if n 1, and T( 1) 2. (d)T(n) T(n - 1)+2 if n >1, and T)-2, (e) T(n) - T(Vn) +1 if n>2, and T(n)0 otherwise