Please draw a tree so that way I can have more idea about how trees goes and what amount of work is done at each level,

4.43 Use a recursion tree to determine a good asymptotic upper bound on the recurrence T(n)=4T(n/2+2)+n. Use the substitution method to verify your