Queue of Service

Start with the definition of the Queue class given in the Source Code folder (examples from the textbook 13.21, 13.22, and 13.23) and modify (re-write) the Queue class to simulate customer arrivals at the Department of Motor Vehicles) counter.

As customers arrive they are given a ticket number. When a customer service agent is free the customer with the next ticket number is called.

This system results in a FIFO queue of customers ordered by ticket number.

Write a program that implements the queue and simulates customers entering and leaving the queue. Input into the queue should be the ticket number and a timestamp when the ticket was entered into the queue.

A ticket and its corresponding timestamp are removed when a customer service agent handles the next customer.

Your program should save the length of time the last three customers spent waiting in the queue. Every time a ticket is removed from the queue update these times and output the average of the last three customers as an estimate of how long it will take until the next customer is handled.