Question $2$: Consider the following recurrence, where n is a power of $8$:

T$($n$)=$

$1$ if n $=1,$

n $+64$ T$($n$=8)$ if n $8.$

Solve this recurrence using the unfolding method. Give the nal answer using Big$-$O

notation.

Solve this recurrence using the Master Theorem.