Consider a B&D queuing system which has a finite number of states denoted by n = 0, 1, 2, 3, 4. The arrival rates are = 4 for = 0, 1, 2, 3. The service rates are = for = 1, 2, 3, 4. Both rates are expressed using the same time unit such as arrivals and services per week. Answer to a) to c) in your Word file.

(a) Give an example of a queuing system which can be described by the arrival and service rates given above.

(b) Calculate the steady-state probabilities {Pn} of the system states using the general approach discussed in class, as well as in the textbook. Determine the expected queue length, the expected arrival rate, and the expected waiting time.

(c) Consider this queuing system in its steady-state condition. Assume that if the system is in state n, then the operating cost per day is f() = 2 (costs are expressed in thousands of dollars). Determine the average operating cost per day.