This is an n player game. Each player is invited to a party, and decides independently whether to bring drinks. If no player brings, they all get payoff 0. If some do, everyone gets 3 (enjoying the drinks) but those who bring them pay 2 to buy the drinks. (Total 1 = 3 – 2 for them.) Show that the strategies where one player always brings drinks and the rest never do is a Nash equilibrium.