1. The following tree diagram shows how the number of bit strings increases with the length of the string.
Since there are two choices for each bit (either 0 or 1), there are 2n bit strings of length n.
Back to Section 6.2
