Please hand draw recursion tree, show thow to calculate tree height, and how to derive the asymptotic upper bound.

Use a recursion tree to determine a good asymptotic upper bound on the recurrence T(n) = 2T(n- 1) + 1