1- Show that in a simple graph G having at least two vertices, there must be two distinct vertices having the same degree.

2- Use the result of 1 to show that in any group of at least two people there must be two people who know the same number of people in the group.