You have chosen to sponsor your bid up to a maximum amount of .
Write a program that will employ QUEUES to simulate customer processing at a retail store. The program is to employ CLASSES and LINKED LISTS. MAJOR FUNCTIONS are to be part of the class.
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. INPUT: Input for this program will be an unknow # of records which includes information about each customer (IS TO BE READ FROM A: drive under the name data5). The data for each customer will appear on one line and will include the customer arrival time, the customer's name, and the processing time for that customer. The arrival time is the instance at which the customer enters one of the 3 checkout lines each one represented by a queue. Processing time is the time it takes the checkout clerk to process the customer's purchase (includes all actions such as ringing up the sale, collecting the money, returning change, bagging the items purchased, etc). The format for the input data is: . The Arrival time is an integer starting at 1 and increasing (non-uniformly) as the simulation proceeds. The Processing Time is an integer between 1 and 25. The Customer's name will be a string of not more than 25 characters. A Customer Name of NO MORE will act as the sentinel. PROCESSING: The program is to process customers as they enter one on the 3 check out line 9Each line is to be represented as a queues) Each customer always wants to be processed as quickly as possible so the following rules apply: 1. Each customer arrives at the appointed arrival time. 2. If a queue is empty, place the customer in the queue and begin to process the customer. 3. If all queues have customers, place the customer in the queue with the shortest total processing time. In case of a tie, select a queue arbitrarily. 4. No processing iss done until the customer is at the head of the queue. 5. Once a customer's processing time is zero, he leaves the store (removed the customer from the queue). WHEN SCANNING ARRAY ALWAYS START WITH #1 AND PROCEED NUMERICALLY. Output: Output for the program consists of 2 list. The first list is the order in which the customers entered the queues ( an echo print of the input data without arrival or processing times). The second list is the order in which each customer was processed (a list of customers as they leave the store). HINT: You may need to use 2 "array of pointers" to maintain the list). Each list needs to have a label and should bve printed out verically. The End of Input message to appear after the 2nd list
## Deadline information
Must use C++ Simple Program Comments Will Provide Winning Bidder: EAMPLE INPUT EXAMPLE OUTPUT EXAMPLE PROGRAM