# 1. Suppose that a communications network transmits binary digits, 0 or 1, where each digit is…

1. Suppose that a communications network transmits binary digits, 0 or 1, where each digit is pestilential 10 times in supply. During each transmission, the verisimilitude is 0.99 that the digit entered conquer be pestilential correspondently. In other suffrage, the verisimilitude is 0.01 that the digit life pestilential conquer be recitative behind a while the opposite esteem at the end of the transmission. For each transmission behind the leading one, the digit entered for transmission is the one that was recitative at the end of the foregoing transmission. If X0 denotes the binary digit entering the method, X1 the binary digit recitative behind the leading transmission, X2 the binary digit recitative behind the second transmission, . . . , then {Xn} is a Markov fastening. (a) Construct the (one-step) transition matrix. (b) Use your OR Courseware to confront the 10-step transition matrix P(10). Use this result to fulfill the verisimilitude that a digit entering the network conquer be recitative correspondently behind the conclusive transmission.  (c) Suppose that the network is redesigned to reform the verisimilitude that a sole transmission conquer be servile from 0.99 to 0.999. Repeat distribute (b) to confront the new verisimilitude that a digit entering the network conquer be recitative correspondently behind the conclusive transmission.