Question $4)$ Compute the following recursive running times using the Master Theorem method:

$4-1)T(n)=3T(\frac{n}{2})+n^2$

$4-2)T(n)=4T(\frac{n}{2})+n^2$

$4-3)T(n)=T(\frac{n}{2})+2^n$

$4-4)T(n)=2^{n}T(\frac{n}{2})+n^n$

$4-5)T(n)=16T(\frac{n}{4})+n$

$4-6)T(n)=2T(\frac{n}{2})+nlogn$

$4-7)T(n)=2T(\frac{n}{4})+n^{0\mathrm{.}51}$

$4-8)T(n)=3T(\frac{n}{3})+\sqrt[\phantom{2}]{n}$

$4-9)T(n)=4T(\frac{n}{2})+logn$