Consider an assembly of people such that in any group of 4 people, there are either 3 who all know each other, or 3 who do not know each other. Show that it is possible to separate the assembly into two groups such that all members of the first group know each other, and no pair of people in the second group know each other.