What is the time complexity for inserting an item in the linked list implementation of priority queues? Explain “Why”. Please, note that inserting items should be in sorted order.

Describe how to implement linked lists as ADTs.

a) Given a typical Queue q with elements [E,D,C,B,A] (where Front/left of Queue at E and Rear/right of Queue at A), determine and list elements of the updated Queue in the similar form (Front/left and Rear/right), after the following execution: q.enqueue( q. dequeue() ) q. enqueue( G ) q.dequeue() b) Given a typical Stack s with elements [T,W,X,Y,Z] (where Top/left of Stack at T) and a typical Queue q with elements [E,D,C,B,A] (where Front/left of Queue at E and Rear/right of Queue at A), determine and list elements of the updated Stack and those of the updated Queue in their similar forms after the following execution: q. enqueue( s.pop() ) s.push( R ) q.enqueue( s. peek () ) s. push( q.dequeue() ) q.enqueue( s. pop() ) OP

Given that we discovered a circular array implementation for queues to be favorable, does this suggest we would find a circularly-linked list to be similarly advantageous? Why should I/shouldn't l?