A service station has three servers, indexed 1, 2, and 3. When a customer ar- rives, he is assigned to the idle server with the lowest index. If all servers are busy, the customer goes away. The service times at server i are iid Exp.i / random vari- ables. (Different 's represent different speeds of the servers.) The customers arrive according to a PP(/. Model this system as a CTMC.