computer scienceWrite a program that simulates a checkout line at a supermarket.
The line is a queue object. Customers (i.e., customer objects) arrive in random integer intervals of
1–4 minutes. Also, each customer is served in random integer intervals of 1–4 minutes. Obviously, the rates need to be balanced. If the average arrival rate is larger than the average service rate, the
queue will grow infinitely. Even with “balanced” rates, randomness can still cause long lines. Run
the supermarket simulation for a 12-hour day (720 minutes) using the following algorithm:
1. Choose a random integer from 1 to 4 to determine the minute at which the first customer
arrives.
2. At the first customer’s arrival time: <br>
Determine customer’s service time (random integer from 1 to 4); <br>
Begin servicing the customer; <br>
Schedule arrival time of next customer (random integer 1 to 4 added to the current time).
3. For each minute of the day: <br>
  If the next customer arrives, <br>
    Say so, enqueue the customer, and schedule the arrival time of the next <br>
    customer; <br>
If service was completed for the last customer; <br>
    Say so, dequeue next customer to be serviced and determine customer’s <br>
      service completion time (random integer from 1 to 4 added to the <br>
      current time).
Now run your simulation for 720 minutes, and answer the following:
What’s the maximum number of customers in the queue at any time? 7th Edition•ISBN: 9780323087896 (1 more)Julie S Snyder, Linda Lilley, Shelly Collins388 solutions

7th Edition•ISBN: 9780323402118Gary A. Thibodeau, Kevin T. Patton1,505 solutions

12th Edition•ISBN: 9780134183268 (1 more)Rebecca J. Donatelle319 solutions

9th Edition•ISBN: 9781259928178 (4 more)Donna F Gauwitz1,201 solutions