Which of the following is true about linked list implementation of queue?Both a and bNone of the mentionedIn push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginningIn push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end

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

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 linked list implementation of a queue, where does a new element be inserted?

Which statements are correct in the priority queue using linked lists?insert(): It is used to insert a new element into the Queue.pop(): It removes the highest priority element from the Queue.peep(): This function is used to retrieve the highest priority element from the queue without removing it from the queue

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