Suppose you have 52 cards with the letters A, 3,0, . . . , Z and a, b, c, . . . ,2: written on them. Consider the following Markov chain on the set S of all permutations of the 52 cards. Start with an},r xed arrangement of the cards and at each step, cheese a letter at random and interchange the cards with the corresponding capital and small letters. For example if the letter "Mfln" is chosen, then the cards "M" and "m" are interchanged. This process is repeated again and again. (a) Count, with justication, the number of communicating classes of this Markov chain. (h) Give a stationary distribution for the chain. (c) Is the stationary distribution unique? Justify your answer. (d) Find the expected number of steps for the Marker chain to return to its initial state