Give asymptotically tight upper and lower bounds for T (n) in each of the followingalgorithmic recurrences. Justify your answers.A. T(n)T(7n/10) + nB. T(n)C. T(n)===D. T(n) =216T(n/4) + n²2T(n/4) + √nn² √n4T(n/2) + nE. T(n) =3T((n/3) - 2) + n/2 (Hint: think about how you can use an assumptionabout the importance of the -2 to apply the Masters Theorem)

Give asymptotically tight upper and lower bounds for T (n) in each of the following algorithmic recurrences. Justify your answers. A. T(n) = T(7n/10) + n B. T(n) = C. T(n) = D. T(n) = 2 16T(n/4) + nº 2T(n/4) + √√n n² √n 4T(n/2) + n° E. T(n) = 3T((n/3) − 2) + n/2 (Hint: think about how you can use an assumption about the importance of the -2 to apply the Masters Theorem)

Give asymptotically tight upper and lower bounds for T (n) in each of the following algorithmic recurrences. Justify your answers. A. T(n) = T(7n/10) + n B. T(n) = C. T(n) = D. T(n) = 2 16T(n/4) + nº 2T(n/4) + √√n n² √n 4T(n/2) + n° E. T(n) = 3T((n/3) − 2) + n/2 (Hint: think about how you can use an assumption about the importance of the -2 to apply the Masters Theorem)