Problem 1: Write a Simulation program of a single queue system with a Poisson arrival process at rate and a. The call holding (service) times are exponentially distributed with a mean of one unit time. b. The call holding (service times are Uniform [0, 2] service time with a mean of one unit time. c. The call holding (service) mes are constant service time with a mean of one unit time. Compare your systems (u n and queue length) for different Poisson arrival rate (e.g., 0.1, 0.2, 0.8), Graph the results

Problem 2: Write a simulation program to compare the efficiency of two systems (A&B) at the check-in counter at an airport. The first system (A) has two separate queues with arrival at rate h/2 and service rates of u. The second system (B) has a single queue with combined arrival at rate and service rates of 2u. The service times are negative exponential distribution l and customers arrive as a Poisson process. Compare your systems (utilization and queue length) for different Poisson arrival rate h (e.g., 0.1, 0.2, 0.80. Graph the results.