Задача 4.

1) Draw a graph with five vertices such that it has neither three pairwise connected vertices nor three pairwise disconnected vertices. 2) Show that in any group of six people we can find either three pairwise acquainted people or three pairwise unacquainted people.