Solve the following recurrences, giving your answer in notation $($so prove both an upper boundand a lower bound$).$ For each of them you may assume T$($x$)=1$ for x $5.$ Justify your answer$($formal proof not necessary, but recommended$).$

T$($n$)=5$T$($n$-3)$