There are 30 coins. While 29 of them are fair, 1 of them flips heads with probability 60%. You flip all 30 coins 100 times. Use the Monte Carlo method to compute within .1% the probability that the unfair coin is in set of 10 coins that land heads most often? (Count the event, that the biased coin is tied with the 10th most common fair coin). Record your answer in ANS62.

Hint: use np.random.binomial to speed up simulation. A binomial variable with parameters n and p is the number of heads resulting from flipping n coins, where each has probability p of landing heads.

Use Python and Numpy to solve this problem