Hello I have an algorithm question could you help me? Prove that, at any party with at least two people, there must be two individuals who know the same number of people present at the party. (It is assumed that the relation a knows b is symmetric.)