Consider a machine which has two failure modes 1 and 2. When it is up, it can go down during a cycle time to failure mode 1 with a probability p1, to failure mode 2 with probability p2, or it can stay up with probability 1-p1-p2. If the machine is in failure mode i it can be repaired during a cycle time; when down, no production takes place.

(1) Can this machine be described by a Markov process?

(2) If so, draw its transition diagram?

(3) Calculate the steady state average throughput of this machine, assuming that no blockages and starvation takes place