n linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue

n linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

In linked list implementation of a queue, where does a new element be inserted?

In linked list implementation of a queue, the important condition for a queue to be empty is?

22. In which location do dynamic variables reside?a) The code segment.b) The data segment.#c) The heap.d) The run-time stacke) The global segment23. I have implemented the queue with a linked list, keeping track of a front pointer and a rearpointer. Which of these pointers will change during an insertion into a NON-EMPTY queue?a) Neither changesb) Only front pointer changes.#c) Only rear pointer changes.d) Both change.e) Front pointer will always change during an insertion24. I have implemented the queue with a linked list, keeping track of a front pointer and a rearpointer. Which of these pointers will change during an insertion into an EMPTY queue?a) Neither changesb) Only front pointer changes.c) Only rear pointer changes.#d) Both changee) Rear pointer will always change25. Identify the data structure which allows deletions at both ends of the list but insertion at only oneend.# a) Input-restricted dequeb) Output-restricted dequec) Priority queuesd) a and be) None of above26. Suppose x is a linked-list node. What is the effect of the following code fragment?x.next = x.next.next;

Given a queue implemented using a linked list, the rear pointer points to the rear node, and front pointer points to the front node of the queue, which of the following statement is not possible in O(1) complexity*2 pointsinsertion at rearinsertion at frontdeletion at frontdeletion at rear