Algorithm Class

Use a recursion tree to solve the following recurrences. Use the substitution method to verify your answer $($include an induction proof!$).$

$1.$ D$($n$)=4$G$($n$/2)+$n$.$

$2.$ E$($n$)=3$E$($n$/3)+$ n