In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?InsertionDeletionTo empty a queueBoth Insertion and To empty a queue

In a linked list implementation of a queue, if only a front pointer is maintained, the operation that takes worst case linear time is "Insertion".

Here's why:

1. Insertion: In a queue, new elements are always added at the rear end. If we only have a front pointer, to insert an element at the rear, we would have to traverse the entire list from the front to the rear. This operation would take O(n) time in the worst case, where n is the number of elements in the queue.

2. Deletion: Deletion in a queue always happens at the front. Since we have a front pointer, deletion would just involve removing the front element and moving the front pointer to the next element. This operation would take constant O(1) time.

3. To empty a queue: This operation would involve deleting all elements one by one. Since deletion takes constant time, to delete n elements would take n*O(1) = O(n) time.

4. Both Insertion and To empty a queue: As explained above, both these operations would take O(n) time in the worst case. However, the question seems to ask for a single operation that takes linear time, so this option may not be the correct answer.

So, the operation that takes worst case linear time when only a front pointer is maintained in a linked list implementation of a queue is "Insertion".