Draw the recursion tree for T(n)=2T(n-1)+1 and calculate 4 important tree parameters: #levels, # nodes at each level, #sum at each level, and # problem size at each level. Optional question: deriving the #total weight of the tree using those 4 parameters and provide the corresponding big o notation