In singly linked structure implementation of queue, if only a front pointer is maintained, which of the following operation take worst case linear time?

Group of answer choices

Empty a queue

Insertion $($enqueue$)$

Deletion $($dequeue$)$

Both insertion $($enqueue$)$ and empty a queue