Around robin tounament of n contestants is a set of matches where each of the n 2 pairs of contestants play each other exactly once, with the outcome of play being that one contestant wins and one loses. for an integer k < n, let’s consider whether it is possible that the tournament outcome is such that for every set of k player, there is a player that beat each member of that set. show that if n k · 1 − 1 2 kn−k < 1 then such an outcome is possible. you may assume that the probability that any contestant beats another is 50/50