Observe the following code:1: temp = queue[front];2: if (front== size-1)3: front = 0;4: else5: front++;6: counter --;Which of the following is FALSE?AThis is the algorithm to remove data from the queueBIn line 2-3, front is set to 0 only if front has reached the maximum indexCIn Line 1, the front data is copied into the temporary storage first before it is removed from the queue.DIn line 5, the statement should be corrected so that it is written front-- to represent the removal of a data from the queue.

In a queue of size 8, the first data is located at index 6 and the last data is located at index 1. Choose one that is TRUE.AThe maximum index of the queue is 8BA remove operation once performed will set the front to be 7CThe front is 1 and tail is 6 currentlyDThere are 3 memories left empty

eries of operations: add(‘k’), add(‘m’), add(‘n’), remove(), add(‘s’) and remove() are performed on an empty queue of size 4. Which of the following is FALSE?AThe next add operation will set tail to 0BThe next two calls to add(item) will make the queue fullCThe value of front is 2 and and the value of tail is 3DThe next delete operation will set front to 0

if front == -1 && rear == -1In the Array implementation of the queue,the above statement implies that: queue isOptionsfullhaving a single elementnone of theseempty

Remove operation on a queue CANNOT be performed if ...Athe queue is fullBthe queue is not fullCthe queue is emptyDthe queue is not empty

Which is the correct operation for:"Remove the front item from the queue and return it"