Which of the following operations has the least running time in a Queue (assume that only Queue interface operations are available; some operations may require use of an additional temporary queue)?

Deleting the element at the rear of the queue.

Swapping the front two elements of the queue.

Checking if an element x is present in the queue.

Finding the number of elements in the queue.

all of the above have identical worst case running time