Give asymptotic upper bound for T$($n$)$ in each of the following recurrence. Make your

bounds as tight as possible.

$($a$)$ T$($n$)=9$ T$($n$/2)+$ n

$3$

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

$3$

$($c$)$ T$($n$)=$

nT$($

$$

n$)+$ n

$($d$)$ T$($n$)=2$ T$($n$/2)+$ n$/$ log n

$($e$)$ T$($n$)=$ T$($n$/3)+2$T$($n$/4)+$ n