Give an asymptotic upper bound $($i$.$e$.,$ Big$-$Oh$)$ for T$($n$)$ in each of the following recurrences. Your bound should be $$reasonably tight$($i$.$e$.,$ don$$t say O$($n$4)$ when you can say O$($n$2)).$ Apply the Master Method $($the version presented in the lecture slides$)$ to justify your work.

$($a$)$ T$($n$)=$ T$(8$n$/11)+$ n

$($b$)$ T$($n$)=2$T$($n$/4)+$n

$($c$)$ T$($n$)=4$T$($n$/2)+$n$/$logn