Consider a single-server system with two types of jobs. the system has a limited capacity of three total jobs in the system at any time. the job classes have different mean arrival and service rates, but all are assumed to be exponentially distributed. let λ1 be the mean arrival rate and μ1 be the mean service rate of job type 1, and let λ2 be the mean arrival rate and μ2 be the mean service rate of job type 2. jobs are served on a non-preemptive priority basis
with job type 1 given preference; that is, once a job starts it cannot be displaced from the machine. (a) develop the labeled directed arc network for this system. hint: there are thirteen different states and the sequence of job types in the queue will always be type 1’s in front of type 2’s. (b) write the equations linking the steady-state probabilities. (c) write a formula for computing (in terms of the pi’s) the total wips, wips by product type, throughput, throughput by product type, the system cts, and cts by product type.