A grocery store has three checkout lanes (checkout 1, checkout 2, and checkout 3), each with a single checker. Shoppers arrive at the checkout area with interarrival times having an exponential distribution with mean 2 minutes. The checkout service time for all shoppers follows an exponential distribution with a mean of 5 minutes regardless of which checkout they choose. Assume the following 2 scenarios: Scenario A: Each checker has its own waiting line The shoppers enter the lane that has the fewest number of other shoppers already in the queue (not queue, the counting any shopper already in service at the checkouts). If there are ties for the shortest shopper will join a checkout at random. Scenario B: There is only one waiting line for all checkers This scenario is called pooling policy where all shoppers will join a line that will be served by any available checker among the 3 checkers. a. (20 points) Create a DES simulation model (static and dynamic description) of this system for both scenarios b. (15 points) Implement the two models in Arena to run for a 24-hours period with 1000 replications (starting empty and idle, and with the first shopper's arriving at time zero) to determine the average time from when the shoppers arrive at the checkout area until they complete their checkout under the 2 scenarios and conclude that which scenario is better to apply.