Chapter 2, Problem 1E

Explanation of Solution

Number of distinct combinations for “n” bits:

• From “2” bits, the user can take the combinations of “00”, “01”, “10”, and “11”.
• The user can takes “$2^2$”, which means “4” combinations from “2” bits.
• Using “3” bits, “$2^3$”, which means “8” combinations can be produced.
• Using “4” bits, “$2^4$”, which means “16” combinations can be produced.
• Therefore, for given “n” bits, “${\text{2}}^{\text{n}}$” distinct combinations can be produced.