$4\mathrm{.}4-3$

Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=4T(\frac{n}{2}+2)+n.$ Use the substitution method to verify your answer.

$4\mathrm{.}4-4$

Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=2T(n-1)+1.$ Use the substitution method to verify your answer.