Determine the asymptotic complexity of each of the following recurrence relations. Justify your

answer with either substitution, a recursion tree, or induction. If the problem takes at least exponential time,

then simply find exponential lower bounds.

$($a$)$

T $($n$)=$ c log$3($n$)+$ T $($n $2),$ T $(0)=$ c

$4$