please solve using the required method and show all work. Thank you

(a) [20 points] Use a recursion tree to determine a good asymptotic upper bound on the recurrence T(n) = 2T(n 1) + 1. (b) [20 points] Show by substitution that the solution to T (n) = 27 () +n2 is 0 (n?)