4-1 Recurrence examples Give asymptotic upper and lower bounds for T(n) in each of the following recurrences. Assume that T(n) is constant for n≤2. Make your bounds as tight as possible, and justify your answers. a. T(n)=2T(n/2)+n4. b. T(n)=T(7n/10)+n. c. T(n)=16T(n/4)+n2. d. T(n)=7T(n/3)+n2. e. T(n)=7T(n/2)+n2. f. T(n)=2T(n/4)+n. g. T(n)=T(n−2)+n2.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!