Problem 6 Five students decide to hold a chess tournament. Each student plays each of the other students exactly once. There are no ties, so every game ends with a winner. At the end of the tournament, some of the students tie for first place (most number of wins). What is the largest number of first place winners possible? Give one example of how that can happen.​