Implement the event-driven simulation of a bank that this chapter described. A queue of arrival events will represent the line of customers in the bank. Maintain the arrival events and departure events in a priority queue, sorted by the time of the event. Use a link-based implementation for the priority queue. The input is a text file of arrival and transaction times. Each line of the file contains the arrival time and required transaction time for a customer. The arrival times are ordered by increasing time. Your program must count customers and keep track of their cumulative waiting time. These statistics are sufficient to compute the average waiting time after the last event has been processed. Display a trace of the events executed and a summary of the computed statistics (the total number of arrivals and average time spent waiting in line). For example, the input file shown in the left columns of the following table should produce the output shown in the right column. Input file Output from processing file on left Simulation Begins Processing an arrival event at time: Processing an arrival event at time: Processing an arrival event at time: Processing a departure event at time: Processing a departure event at time: Processing a departure event at time: 2 2 4 20 22 4 24 26 28 11 16 20 22 Processing an arrival event at time: Processing an arrival event at time: Processing an arrival event at time: Processing a departure event at time: Processing an arrival event at time: Processing an arrival event at time: Processing an arrival event at time: Processing a departure event at time: Processing a departure event at time: Processing a departure event at time: Processing a departure event at time: Processing a departure event at time: Processing an arrival event at time: Processing a departure event at time: Simulation Ends 30 88 24 25 26 28 30 30 35 40 45 50 88 91 5555 555 S53