Queuing Theory Simulation Problem using Rockwell Arena

Hi, I need regular homework help on simulation problems in Arena beginning with the simulation problem below. I would like this complete ASAP so let me know if you are capable and available to help complete this first and other tasks later through the next few months. Thank you! TO Simulate in Arena: (Submit .doe file) Customers arrive at an order counter with exponential interarrivals with a mean of 10 minutes; the first customer arrives at time 0. A single clerk accepts and checks their orders and processes payments, taking UNIF(7.9; 10) minutes. Upon completion of their 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 sytem and run the simulation for 5000 minutes, observing the average and maximum customer time in system. 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, run it for 5000 minutes, and compare the results to the rest of the system.