A Markov chain problem. Please provide clear steps. Thank you!

A. box contains N balls, some red and some blue. At each step, a coin is ipped with probability p of coming up Heads, and probability 1 p of coming up Tails. If the coin comes up Heads, a ball is chosen at random from the box and is replaced by a rod ball; if the coin comes up Tails then a ball is chosen randomly iron: the box and replaced by a blue ball. Let X\" denote the number of red balls in the box after H steps. Find the transition matrix for the chain {Kn}, and nd the stationary distribution. [Hint: is the chain reversible Compute liIn.n_Hm E[Xn], and explain why you could have guessed your answer without doing the calculation