Solve the following recurrence using the "backward substitution"

method.

T$($n$)=$ T$($n$-1)+$ ncube, for n $>1$

T$(1)=5$

Show your work similar to the example from the notes. You do not need

to prove the correctness using mathematical induction. Just solve T$($n$)$

using $-$ notation, as a function of n$.$

$2.$ Solve the following recurrence using the "change of variable"

method. Use the change of variable $.$ Show you work

similar to the example from the notes.

T$($n$)=9$T$($cuberootn$)+4($logbase$3$n$)$wholesquare