Chapter 15.4, Problem 2P

In the expansion of ${(a+b)}^n$ (see Example 2), let $a=b=1$, and interpret the terms of the expansion to show that the total number of combinations of $n$ things taken $1,2,3,\cdots ,n$ at a time, is $2^n-1$.