A sundae bar offers 6 toppings, and any number of them may be chosen, including none. How many different sundaes are possible?

1. Choosing any subset of toppings means each topping is independently in or out. 2. A set of n distinct objects has 2^n subsets, counting the empty choice. 3. With n = 6 toppings, that gives 2^6 = 64 different sundaes. 4. Option A, 36, squares 6 instead of doubling six times, a common slip with the subset rule. _Source: OpenStax Algebra and Trigonometry (CC BY 4.0), Ch 13 "Sequences, Probability and Counting Theory", section 13.5 COUNTING PRINCIPLES_