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 e is a constant. Make your bounds as tight as possible, and justify your answers. (a) T(n)T(n 1)+1/n (b) T(n)-T(n 1) +c”, where c > 1 is some constant (c) T(n) = 2T(n-1) + 1 e) T(n)-27T() +cn CTL (f) T(n) = 5T() + cr? Use the master theorem to give tight
OR
OR