What happens when the rear pointer reaches the end of the array in the array representation of a 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

In a queue implemented using a circular array, if front = rear, what can be inferred about the queue?The queue is full.The queue is empty.The queue has exactly one element.Either the queue is full or empty, depending on the implementation.

In a Circular Queue, when the "front" and "rear" pointers are both pointing to the same location, the queue is considered _____.a)fullb)overflowedc)half-fulld)empty

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

n linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue