Suppose that the times between successive arrivals of customers at a single-
server station are independent random variables having a common distribution
\(F .\) Suppose that when a customer arrives, he or she either immediately
enters service if the server is free or else joins the end of the waiting line
if the server is busy with another customer. When the server completes work on
a customer, that customer leaves the system and the next waiting customer, if
there are any, enters service. Let \(X_{n}\) denote the number of customers in
the system immediately before the \(n\) th arrival, and let \(Y_{n}\) denote the
number of customers that remain in the system when the \(n\) th customer
departs. The successive service times of customers are independent random
variables (which are also independent of the interarrival times) having a
common distribution \(G\).
(a) If \(F\) is the exponential distribution with rate \(\lambda\), which, if any,
of the processes \(\left\\{X_{n}\right\\},\left[Y_{n}\right\\}\) is a Markov
chain?
(b) If \(G\) is the exponential distribution with rate \(\mu\), which, if any, of
the processes \(\left\\{X_{n}\right\\},\left\\{Y_{n}\right\\}\) is a Markov
chain?
(c) Give the transition probabilities of any Markov chains in parts (a) and
(b).