You are going to create a customer queue, much like the one at the AT&T store. Customers are added to the queue as they arrive (first come, first served), but they are removed as they are helped and if they give up and leave the store. This information would be input by a customer service representative (who is your user). When a change is made, the queue prints out. Changes include: add new customer (a), help a customer (h), delete a customer (d), and find a customer (f). We assume that each customer name is unique. - New customers are added to the end of the queue. - When the next customer is ready to be helped, you need to retrieve their name and delete them from the queue and update everyones place in line. - When a customer gives up and leaves, that customer needs to be deleted and everyones place in line is again updated. - When finding a customer, you need to search for them in the queue. If they are not found, you need to add them.You will need to create a LinkedList class and customer class