Consider the following queue operations:

i. enqueue(): insert an element at the rear.

ii. dequeue(): deletes an element from front.

iii. isEmpty(): returns true if queue is empty.

iv. isFull(): returns true if queue is full.​​

v. contains: returns true if given element is present in queue.

Which of the above operation takes O(n) time to execute?