Exercise 1. Consider a M/M/1 queue with job arrival rate and service rate . There are two jobs (J. and Jy) in the queue, with J. in service at time t = 0. Jobs must complete their service before departing from the queue, and they are put in service using First Come First Serve. The next job to arrive in the queue is referred to as 13. Final answers must be reported using only . and M. A) Compute the probability that Jy arrives when: Case A: the queue is empty (PA), Case B: the queue has one job only that is J. (PB), and Case C: the queue has two jobs that are J. and J2 (Pc). (pt. 15). B) Compute the expected departure time of job J. (defined as ts) and the expected departure time of job Ja (defined as tya) [pt. 10). C) Compute the expected departure time of job J, for the following mutually exclusive cases: Case A: defined as +134. Case B: defined as 30, and Case C: defined as t3c fpt. 15). Exercise 1. Consider a M/M/1 queue with job arrival rate and service rate . There are two jobs (J. and Jy) in the queue, with J. in service at time t = 0. Jobs must complete their service before departing from the queue, and they are put in service using First Come First Serve. The next job to arrive in the queue is referred to as 13. Final answers must be reported using only . and M. A) Compute the probability that Jy arrives when: Case A: the queue is empty (PA), Case B: the queue has one job only that is J. (PB), and Case C: the queue has two jobs that are J. and J2 (Pc). (pt. 15). B) Compute the expected departure time of job J. (defined as ts) and the expected departure time of job Ja (defined as tya) [pt. 10). C) Compute the expected departure time of job J, for the following mutually exclusive cases: Case A: defined as +134. Case B: defined as 30, and Case C: defined as t3c fpt. 15)