Match the term with its definition Enqueue Dequeue First Size isEmpty with Check if the queue is empty Check the front element without removing Number of elements in the queue Remove the front element Add an element (back)

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

if front == -1 && rear == -1In the Array implementation of the queue,the above statement implies that: queue isOptionsnone of theseemptyfullhaving a single element

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

The dequeue operation should throw an exception if it removes the last element in the queue. A. True B. False

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.