6. A certain computer uses only the digits 0 and 1. It is supposed to transmit one of these digits through several stages. At every stage, there is a probability p that the digit that enters this stage will be changed when it leaves and a probability q = 1 p that it will stay the same. Form a Markov chain to represent this process of transmission; the states are {0, 1}. Write down the transition matrix. 7. For the computer above, suppose it starts with state 0. What is the probability that after two stages, the computer produces the correct digit [i.e., 0)