help will be appreciated

Prob 3. In a round-robin tournament with in. players, every two players play one game in which one player wins and one player loses {i.e., there are no ties]. Assume that when two players compete it is equally likely that either player wins that game. and that the ouoomes of different games are independent. Let E he the event that for everyset S ofk players1 where k <: m is a player who has beaten all k players in s. show that fee e where f the event there no heats from jth subset of ir players. probability f1 conelude parts and pm _ gmk use part to nd values m. such tournament with for every set s two both repeat sets three>