Problem Statement

What does the following code do? void Queue(int element) { if (!isFull()) { if (front == -1) front = 0; rear = (rear + 1) % size; items[rear] = element; } } Pick ONE option Delete an element from the queue. Traverse the queue. Insert an element into the queue. Run time error Output Format Print the text of the correct option exactly as it appears above.