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

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.

Consider a queue implemented as an array. The queue has a maximum capacity of 5. Initially, the queue is empty. After performing the following operations: enqueue(1), enqueue(2), enqueue(3), dequeue(), enqueue(4), enqueue(5), what will be the front and rear pointers respectively?front = 0, rear = 4front = 1, rear = 4front = 1, rear = 0front = 0, rear = 3

Consider the queues Q1 containing four elements and Q2 containing none (shown as the Initial State in the figure). The only operations allowed on these two queues are Enqueue (Q, element) and Dequeue (Q). The minimum number of Enqueue operations on Q1 required to place the elements of Q1 in Q2 in reverse order (shown as the Final State in the figure) without using any additional storage is ______________.*2 points4568

In a Circular Queue of size 8, if you enqueue 6 elements and then dequeue 4 elements, how many empty slots are there in the queue?a)3b)1c)2d)0

In a circular queue of size 7 if front index=5 and rear index =3 then ___ enqueue operations has been performed.