Question:

Three Englishmen and three Frenchmen each know one unique secret. Only one Englishman knows French, no Frenchman knows English. They exchange secrets via person-to-person calls so all know all secrets. What is minimum number of calls?

Show Hint

Model the problem as two cliques with a single bridge vertex.
Updated On: Jul 31, 2025
  • 5
  • 10
  • 9
  • 15
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

Calls within each language group share secrets internally: 2 calls within English group, 2 within French group. The bilingual acts as bridge: 1 call to transfer all secrets from one group to another, then additional calls to propagate new info within groups. Counting carefully gives 9 minimum. \[ \boxed{9} \]
Was this answer helpful?
0
0