A big chain grocery store was giving away domino pieces for every 20 CHF one spends from September until Nov. 2. These domino pieces have flags of Swiss Cantons and half Cantons. Suppose we now aim to collect all flags of Swiss Cantons and half Cantons. This is equivalent to the coupon collector’s problem: Coupons in this context map to the dominos with flags of Swiss Cantons and half cantons, and are being collected with replacement. Let T be the time to collect all n = 36 dominos. Let Ti be the time to collect the i-th new domino after i − 1 unique dominos have been collected. The key for solving the problem is to understand that it takes very little time to collect the first few dominos. On the other hand, it takes a long time to collect the last few new dominos. Note that T1 = E[T1] = 1. (a) Compute the probability of collecting a domino with a new flag given that i − 1 unique ones have been collected. (b) What is the distribution of Ti? (c) Compute the expected value E