Answer: 2n - 1.
- A 2n
- B 2n - 1
- C n!
- D n
Correct answer: B. 2n - 1
Explanation: Total subsets = 2n. Excluding empty set: 2n - 1 ways to select at least one object.
Counting tree for selecting 2 items from {A, B, C} without repetition: 3 x 2 = 6 ordered arrangements.
Concept context
Counting, arrangements, and selections