Difficulty: Medium
Correct Answer: Statement I alone is sufficient; Statement II alone is not sufficient.
Explanation:
Introduction / Context:
Classic two-set (chess, cricket) problem asking for the 'only chess' count.
Given Data / Assumptions:
Concept / Approach:
Use inclusion–exclusion on the playing subset.
Step-by-Step Solution:
Verification / Alternative check:
Check non-negativity and totals: 0 + 4 + 38 + 22 = 64 ✔.
Why Other Options Are Wrong:
Common Pitfalls:
Forgetting that 'k between' style offsets do not apply here; misapplying inclusion–exclusion.
Final Answer:
A — Statement I alone suffices (Only chess = 0).
Discussion & Comments