Suppose you are designing a multi-player game that has n ≥ 1000 players, numbered 1 to n, interacting in an enchanted forest. the winner of this game is the first player who can meet all the other players at least once (ties are allowed). assuming that there is a function meet(i, j), which is called each time a player i meets a player j (with i 6= j), describe a way to keep track of the pairs of meeting players and who is the winner.