3.3.2 Three fair coins are tossed, and we let X1 denote the number of heads that appear. Those coins that were heads on the first trial (there were X1 of them)

we pick up and toss again, and now we let X2 be the total number of tails, including those left from the first toss. We toss again all coins showing tails, and let X3 be the resulting total number of heads, including those left from the previous toss.We continue the process. The pattern is, count heads, toss heads, count tails, toss tails, count heads, toss heads, etc., and X0 D 3. Then, fXng is a Markov chain. What is the transition probability matrix?