Customers arrive at an order counter with exponential inter-arrivals with a mean of 10 minutes; the first customer arrives at time 0. A single clerk accepts and checks the orders and processes payments, taking UNIF (8, 10) minutes. Upon completion of this activity, orders are randomly assigned to one of two available stock persons (each stock person has a 50% chance of getting any individual assignment) who retrieve the orders for the customers, taking UNIF (16, 20) minutes. These stock persons only retrieve orders for customers who have been assigned specifically to them. Upon receiving their orders the customers depart the system. Develop a model of this system and run the simulation for 5,000 minutes, observing the average and maximum customer time in system. Consider first 500 minutes as warm-up period. Run the model for 5 replications and show graphically the results for single replication and 5 replications. A bright, young engineer has recommended that they eliminate the assignment of an order to a specific stock person and allow both stock persons to select their next activity from a single first-come, first-served order queue. Develop a model of this system for 5,000 minutes, and compare the results to the first system. Animate your model.