Solving Recurrence with recursion tree method $4\mathrm{.}4-3$ Use a recursion tree to determine a good asymptotic upper bound on the recurrence T$($n$)=4$ T$($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$)=2$ T$($n$-1)+1.$ Use the substitution method to verify your answer.T$($n$)=$T$($n$-1)+1$ T$($n$)=$T$($n$-1)+2$