Solve the following recurrence relations. (a) You need to show your work to get the credits. T(n) = 3T(n-1) + n for all n > 0 T(1) = 4 (b) You need to show your work to get the credits. T(N) = T(0) + T(N-1) + N, N 1, T(0) = 0 (c) You need to show your work to get the credits. T(n) = 2T(n-1) - T(n-2) for n 2; T(0) = 3; T(1) = 3