2 Coupon Collector Variance It's that time of the year again-Safeway is offering its Monopoly Card promotion. Each time you visit Safeway, you are given one of n different Monopoly Cards with equal probability. You need to collect them all to redeem the grand prize. Let X be the number of visits you have to make before you can redeem the grand prize. We've shown in discussion that Var(X) =n ()_i 2) - E[X]. The series _ i - converges to the constant value -/6. Using this fact and Chebyshev's Inequal- ity, find a lower bound on B for which the probability you need to make more than E[X] + Bn visits is less than 1/100, for large n. [Hint: Use the approximation )_i ~ Inn as n grows large.)