Consider a preemptive priority queueing system with two classes of customers. High priority customers arrive according to a Poisson process with rate H customers per second. Low priority customers arrive to the system according to a Poisson process with rate L customers per second. The system can hold a maximum of three customers. If there are already three customers in the system, then any arriving customer of either priority will be blocked from entering. The service time distribution for all customers is exponentially distributed with an average service time of 1 seconds. Preempted low priority customers are placed back in the queue. Let NH be the state variable for the number of high priority customers in the system, and let NL be the state variable for the number of low priority customers in the system. (a) Draw the state diagram of the system. Clearly indicate transition rates. For the rest of the problem, assume that the steady state probablity p(n, m) = P r(NH = n, NL = m) is known. You do not need to solve for this probability. (b) What is the expected number of high priority customers in the system? (c) What is the throughput for