2.8. An airline reservation system has a single computer, which breaks down on any given day with probability p. It takes two days to restore a failed computer to normal service. Form a Markov chain by taking as states the pairs (x, y), where x is the number of machines in operating condition at the end of a day and y is 1 if a day's labor has been expended on a machine, and 0 otherwise. The transition probability matrix is

Compute the system availability iro for p = 0.01, 0.02, 0.05, and 0.10.

To State (1, 0) (0, 0) (0, 1) From State (1, 0) P P = (0, 0) 0 1 (0, 1) 0