$($a$)$ Substitute n $=$ log$($m$)$ into your recurrence relation for T$($n$)$ above, and use the Master Theorem to prove that T$($n$)=\backslash$Theta $(2$n$).$ Briefly explain how and why your formula in part $($c$)$ is indeed $\backslash$Theta $(2$n$).$