Let X denote the number of heads when flipping a fair coin n times, i.e., X \\sim \\Bintn,p] with p : 1/2. Find a Chernoff bound for Pr (X I_> 0,). Find the sharpest [i.e., smallest) Chernoff bound. Evaluate your answer for n=100 and 51:68. Enter the bound below using four decimal places