Solving recurrences using the Master method. Give asymptotic upper and lower bounds for T$($n$)$ in each of the following recurrences. Solve using the Master method. Assume that T$($n$)$ is constant for n Make your bounds as tight as possible and justify your answers.

a$.T(n)=2T(\frac{n}{3})+1$

b$.T(n)=5T(\frac{n}{4})+4n$

c$.T(n)=25T(\frac{n}{5})+n^2$

d$.T(n)=2T(\frac{n}{3})+nlgn$

e$.T(n)=3T(\frac{n}{5})+l{g}^{2}n$