Draw the recursion tree and use it to calculate an asymptotically tight bound on T $($n$).$ That is find

an f $($n$)$ in each case such that T $($n$)=\backslash$Theta $($f $($n$)).$ You don$$t need to provide a formal proof for this

step.