For the following two recurrerces give best possible asymptotic upper

bound on $T(n)$ as a function of $n.$ Express your answer using Big Ob

bound on T $(n)$ as a function of $n.$ Expess your answer $2$ marks for the

carrect approach$)$

$(1)T(n)=T(n-1)+n^{\text{'}2}.$

$(2)T(n)=9T(\frac{n}{3})+n^{\text{'}\text{'}2}.$