The code for this problem will involve performing a summation using a loop until the numbers either diverge or converge. The program will compute such statistics as the time a customer spends in the queue and in the system, the expected line length, and the expected number of customers in the system.

We wrote the code using C++. The arrival process of the customers is assumed to be Poisson, that is, the service is assumed to be deterministic and provided to customers on a first come, first served basis (FIFO). Markovian equations and Poissons arrival equations are applicable to a queue scenario. In the scenario, the customer enters the system, collects the goods, waits to be served, is served, and leaves the system. The management uses the program to analyze and prepare work schedules for the employees accordingly. The expected outcome, shorter wait times, facilitates the scheduling of enough employees during the peak periods of customers into the system and is a useful tool for any manager, of either humans or inanimate objects.