4. 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. (a) T(n) -T(n-1+1/n (b) T(n)-T(n-1) + cn, where c 〉 1 is some constant (c) T(n)-2T(n -1) +1 Show transcribed image text 4. Give asymptotic upper and lower bounds for T(n) in each of the
OR
OR