Draw a recursion tree for the following recurrences and use it to obtain asymptotic bounds as tight as

possible.

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

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