Consider the recurrence T$($n$)=2$T$($n$-1)+1.$

Draw the top three levels of the recursion tree for this example, as was

shown in the in$-$class exercise for week W$2.$ Be sure to list the total amount of work done at

each level