For the nonpreemptive priority queue with two classes, suppose that 1 = 2 = 1, 1 = 3, and 2 = 2 (i.e., the class

For the nonpreemptive priority queue with two classes, suppose that λ1 =

λ2 = 1, µ1 = 3, and µ2 = 2 (i.e., the class with faster service has priority).

Show that the expected queue wait Wq is lower than that of the ordinary M/M/1 queue with 1/µ = 1/(2µ1) + 1/(2µ2). What happens when the class with slower service has priority?