32. Customers arrive at a two-server station in accordance with a Poisson process having rate k. Upon arriving, they join a single queue. Whenever a server completes a service, the person first in line enters service. The service times of server / are exponential with rate ì , · , /= 1, 2, where ìë + ì2 > k.

An arrival finding both servers free is equally likely to go to either one.

Define an appropriate continuous-time Markov chain for this model, show it is time reversible, and find the limiting probabilities.