4.7.10

The Gossip Problem:

If everyone has a unique “secret” and shares every “secret” they know with someone whenever they have a conversation, what is the fewest number of conversations that must happen for any number of people to share all their secrets with each other?

Use a vertex-edge graph and one paragraph of explanation for your solution.  Remember: you are looking for a pattern/rule, not for a particular number.  I would recommend starting with a small number of people and working your way up to at least 10.