Simulate a checkout area of a supermarket consisting of one super-express counter, two express counters, and numStandLines standard counters. All customers with numSuper or fewer items proceed to a super-express counter with the fewest customers, unless there is a free express or regular line, and those with between numSuper and numExp proceed to the express counter with the shortest line unless there is a free standard line. Customers with more than numExp go to the standard counter with the shortest standard line. The number of items bought will be a random number in the range 1 to maxltems. The time to process a customer is 5 seconds per item. Calculate the following statistics:
• Average waiting time for each of the lines
• Overall average waiting time
• Maximum length of each line
• Number of customers per hour for each line and overall
• Number of items processed per hour for each line and overall
• Average free time of each counter
• Overall free time Note: The average waiting time for a line is the total of the customer waiting times divided by the number of customers. A customer's waiting time is the time from when he (or she) enters the queue for a given checkout line until the checkout processing begins. H the customer can find a free line, then the wait time is zero.
Your program should read the following data: