6. A system is being designed. The inter-arrival times of customers are expected to be exponentially distributed with mean 1/1 = 50 msec. Three options are considered as illustrated in Figure 2. arrivals arrivals and departures departures (a) One single server queue 110 departures departures arrivals dispatcher departures (a) Two single-server queues arrivals departures (c) One two-server queue Fig. 2 - Three options. (a) One single-server queue with infinite buffer space. The service times are exponentially distributed with mean 1/u = 20 msec. (b) Two single-server queues, each with infinite buffer space. Customers are randomly dispatched to each queue with an equal probability. The service times are exponentially distributed with mean 1/u = 40 msec at each server. (c) One two-server queue with infinite buffer space. The service times are exponentially distributed with mean 1/u = 40 msec at each server. Find the response time in each option using queueing analysis. 6. A system is being designed. The inter-arrival times of customers are expected to be exponentially distributed with mean 1/1 = 50 msec. Three options are considered as illustrated in Figure 2. arrivals arrivals and departures departures (a) One single server queue 110 departures departures arrivals dispatcher departures (a) Two single-server queues arrivals departures (c) One two-server queue Fig. 2 - Three options. (a) One single-server queue with infinite buffer space. The service times are exponentially distributed with mean 1/u = 20 msec. (b) Two single-server queues, each with infinite buffer space. Customers are randomly dispatched to each queue with an equal probability. The service times are exponentially distributed with mean 1/u = 40 msec at each server. (c) One two-server queue with infinite buffer space. The service times are exponentially distributed with mean 1/u = 40 msec at each server. Find the response time in each option using queueing analysis