There are n≥2 people at a party. Each person has at least one friend inside the party. Show that it is possible to choose a group of no more than 2n people at the party, such that any other person outside the group has a friend inside it. combinatoricsgraph theoryfriendly