Given recurrence $T(n)=T(n-1)+n$

a$)$ What is the asymptotic upper bound of this recurrence? $($Hint: use recursion tree to determine.$)$

b$)$ Make your bounds as tight as possible and justify your answers using the substitution method.