Difficulty: Easy
Correct Answer: 66
Explanation:
Introduction / Context:
Each handshake corresponds to an unordered pair of people. Counting unique handshakes among n participants equals the number of 2-combinations C(n,2).
Given Data / Assumptions:
Concept / Approach:
Step-by-Step Solution:
Verification / Alternative check:
Degree-sum in complete graph K12: sum of degrees = 12*11; divide by 2 equals number of edges = 66 (handshakes).
Why Other Options Are Wrong:
Common Pitfalls:
Final Answer:
66
Discussion & Comments