Gproblem 1g a deck consists of n cards, numbered 1 through n. the deck is going to be shuffled. assume that all permutations of the n cards are equally likely. let 1 ≤ m1, m2, k1, k2 ≤ n. a) how many permutations are possible? b) in how many permutations does card number m1 falls in place number k1? c) what is the chance that card number m1 falls in place number k1? d) what is the chance that card number m1 falls in place number k1 and card number m2 falls in place number k2? e) for1≤i≤n,. letm bethetotalnumber of matches. fine e(m) and v ar(m). [hint: it is a good move to write m as the sum of indicators. if you have forgotten what those are, see example d on page 129 of your text, or the section entitled the method of indicators starting on page 168 of pitmans probability book. and dont forget the indicators, nor any dependence issues, when you calculate the variance.] f) what happens to the distribution of m as n → [infinity]? you dont have to give a mathematical proof, but you should provide a convincing heuristic argument. and you should show that your limit distribution is consistent with your answers to part e). problem 1h