Use recursion trees to solve each of the following recurrences. Each tree should show levels

$0,1,2,$ and $,$ as we did in class. From that tree, derive the asymptotic running time

$($e$.$g$.,()$ or $($ lg $)).$ Assume that $(0)=(1)=1$ for each recurrence.

a$)()=2(/4)+$

b$)()=3(/3)+$

c$)()=4(/2)+$