Give an asymptotic solution $($which should be a $\backslash$Theta $-$bound$)$ to each of the recurrences below. You may use

whatever solution method you wish $($drawing out the tree, unrolling the recurrence, proof by induction,

Master Theorem, etc.$),$ but make sure you fully justify your answer.

$1.$ T$($n$)=2$T$($n $1)+$ c for n $>1,$ T$(0)=1.$

$2.$ T$($n$)=4$T$($n$/3)+$ cn log n for n $>1,$ T$(1)=1$

$3.$ T$($m$,$ n$)=$ mT$($m$,$ n$/2)+$ cn for n $>1$ and m $>0$; T$($m$,1)=1$