NEED ALL PARTS. Please provide full answer. Thanks in advance!

Give asymptotic upper and lower bounds for T (n) in each of the following recurrences. Assume that T (n) is constant for sufficient small n, and c is a constant. Make your bounds as tight as possible, and justify your answers. T (n) = T (n - 1) + 1 T (n) = T (n - 1) + c^n, where c > 1 is some constant T (n) = 2T (n - 1) + 1 T (n) = 2T (n/2) + Squareroot n T (n) = 3T (n/2) + cn T (n) = 27T (n/3) + cn^3 T (n) = 5T (n/4) + cn^2