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 event list. 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$).$

Reproduce que diagram $13\mathrm{.}8pp\mathrm{.}388$ with the data example problem.

Define a Client class with two attributes.

a$.$ One attribute is called status OfClient of character data type. $(\text{'}$A$\text{'}$ or $\text{'}$D$\text{'})$;

b$.$ One attribute is called transaction Time of integer data type.

c$.$ One attribute is called ArrivedTime of integer data type.

Use PriorityQueue $($Client$)$; the priority is the time of arrival$/$departure of the client and LinkedQueue $($waiting list$)$ structures to problem solve. Both structures are textbook code.

Solve Question $7,$ pp$.390$