If the following operations are performed on an initially empty Queue, what will be the sequence of the popped numbers? push(9), pop(), push(5), push(7), pop(), pop(), push(8), pop()

What is the worst-case time complexity of inserting 'n' elements into an initially empty linked list such that the linked list remains sorted?

What are the contents of an initially empty stack (from bottom to top) after performing the following operations? PUSH(A); PUSH(B); PUSH(C); POP; PUSH(D); POP; POP; PUSH(E); PUSH(F); POP;