Hi, need help with the following question. It is promised that a given coin is either fair (Pr(Head) = 1/2) or biased
with Pr(Head) = 1/2 + ε where 0 < ε < 1/2. Show that 100/ε^2 coin
tosses are sufficient to correctly determine the type of coin (fair or biased)
with at least 4/5 probability, i.e., give an algorithm that will need at most
100/ε^2 coin tosses, and should have the following guarantee: if the coin
is fair the algorithm will return ‘fair’ with probability at least 4/5, and if
the coin is biased then algorithm will return ‘biased’ with probability at