Give asymptotic upper and lower bounds for T(n) in each of the following recurrences. Assume that T(n) is constant for n 10. Make your bounds as tight as possible, and justify your answers. please show work using substitution, master method or recursion tree, thanks!

(e) T(n)= 107(n/3) + 17n1.2 (f) T(n) = 77(n/2)+n3