2 1805 3 1060 4 690 5 470 6 325 7 223 8 147 Number of cashiers: 1 Average time: 4050 Optimum number of cashiers is: 9 Average processing time: 90 Press any key to continue .. All businesses want to keep their customers happy. To do that, many companies assign a certain amount of time to each customer to optimize the business. The alternative would be to hire more employees, which would lead to higher costs. This problem requires you to simulate how authorities optimize the number of cashiers at the entrance of a toll bridge to make sure drivers are satisfied. Make the following assumptions: There is one cashier per line. The line works as a queue with no cars cutting the line or leaving it. One car arrives at the entrance every 10 seconds. It takes 90 seconds (1.5 minutes) to process the payment, starting from the moment a cashier is available. Assume there is no pause between cars. Your Tasks: 1. Design class CarinLine, with the following specifications: The class has two instance variables: arrival Time and Departure Time, stored as integers. Define a constructor that accepts an integer as an argument representing the arrival time, in which you set the departure time to zero, marking the beginning of a simulation. Create an appropriate set and get methods for the two instance variables. Implement a method totalTime() that returns an integer value representing the time spent in the queue, as the difference between the departure time and the arrival time. 2. Define ten queues, simulating the functionality of the process, increasing the number of cashiers from one, and collecting the average waiting time for each scenario. 3. Each simulation will work with the same number of cars, which is considered 100. 4. The maximum number of cashiers/toll booths is 10. 5. Create the queue with link-based implementation. 6. Create each queue with the corresponding number of cashiers, from 1 to 10, and record the average processing time. 7. Save the processing time in an array of integer values representing the processing time. 8. At the end of the simulation, display the results in a table with the number of cashiers and the average waiting time, measured in seconds. 9. Choose the optimum number of cashiers, considering that the desired wait time is 1.5 minutes (90 seconds) 10. Display the result of your simulation, which is the optimum number of cashiers. 11. If you implement all the required methods correctly, the driver program should generate outputs similar to the following: Number of cashiers Average time: 1995 690 1060 470 325 223 147 4ese Optimus number of cashiers ist 9 Average processing time: 90 Press any key to continue. 2 1805 3 1060 4 690 5 470 6 325 7 223 8 147 Number of cashiers: 1 Average time: 4050 Optimum number of cashiers is: 9 Average processing time: 90 Press any key to continue .. All businesses want to keep their customers happy. To do that, many companies assign a certain amount of time to each customer to optimize the business. The alternative would be to hire more employees, which would lead to higher costs. This problem requires you to simulate how authorities optimize the number of cashiers at the entrance of a toll bridge to make sure drivers are satisfied. Make the following assumptions: There is one cashier per line. The line works as a queue with no cars cutting the line or leaving it. One car arrives at the entrance every 10 seconds. It takes 90 seconds (1.5 minutes) to process the payment, starting from the moment a cashier is available. Assume there is no pause between cars. Your Tasks: 1. Design class CarinLine, with the following specifications: The class has two instance variables: arrival Time and Departure Time, stored as integers. Define a constructor that accepts an integer as an argument representing the arrival time, in which you set the departure time to zero, marking the beginning of a simulation. Create an appropriate set and get methods for the two instance variables. Implement a method totalTime() that returns an integer value representing the time spent in the queue, as the difference between the departure time and the arrival time. 2. Define ten queues, simulating the functionality of the process, increasing the number of cashiers from one, and collecting the average waiting time for each scenario. 3. Each simulation will work with the same number of cars, which is considered 100. 4. The maximum number of cashiers/toll booths is 10. 5. Create the queue with link-based implementation. 6. Create each queue with the corresponding number of cashiers, from 1 to 10, and record the average processing time. 7. Save the processing time in an array of integer values representing the processing time. 8. At the end of the simulation, display the results in a table with the number of cashiers and the average waiting time, measured in seconds. 9. Choose the optimum number of cashiers, considering that the desired wait time is 1.5 minutes (90 seconds) 10. Display the result of your simulation, which is the optimum number of cashiers. 11. If you implement all the required methods correctly, the driver program should generate outputs similar to the following: Number of cashiers Average time: 1995 690 1060 470 325 223 147 4ese Optimus number of cashiers ist 9 Average processing time: 90 Press any key to continue