$1.$I have written a Java program that represents a queue data structure to simulate a queue of customers waiting to a grocery checkout line.

Implemented the queue using Java queue interface by linkedlist.

Print menu with numbers and description as follows:

$1.$ Insert

$2.$ Remove

$3.$ Peek

$4.$ Check Empty

$5.$ Check Full

$6.$ Size

Then scan the number insert by the user and apply the function related to the number. Each function

should have print in last line to print out the results.

After that the program should ask user if like continue or not. If $$Yes$$ is answer, then show again the

above menu and wait for user. Otherwise, if the response from user is $$No$$ then exit the program.

Explanation of my code:$-$

We start by introducing the program to the user.

We create a Queue object using LinkedList to represent the grocery checkout line.

We use a Scanner object to get user input.

We run a simulation loop that continues until the user decides to stop.

Inside the loop, we present the menu options to the user and execute the corresponding action based on their choice.

Actions include inserting a customer to the queue, removing a customer from the queue, peeking at the next customer, checking if the queue is empty, checking if the queue is full $($though for LinkedList implementation, it's always not full$),$ and getting the size of the queue.

After each action, we ask the user if they want to continue. If the response is not "Yes", the simulation loop ends

Question:$-$ Visualise the Queue that is implemented and explain FIFO concept

of your developed code for all of the $6$ steps by an example and explain the benefits and

advantages are of applying queue.