5.6.9
The Gossip Problem:
- Every person has a unique secret. When two people have a conversation, they share all the secrets they know. What is the minimum number of conversations that x number of people can have so that each one of them knows all the other secrets?
- Use vertex-edge graphs to model this situation for 4-10 people.
- Record any patterns you notice.