Solve all the answers below

1,

What is the final state of the queue, reading from the front of the queue to the back, after the operations below are performed, in the order listed, on an empty queue?

queue.enqueue("Ryan") queue.dequeue( ) queue.enqueue("Banks") queue.enqueue("Private") queue.enqueue("Hanks") queue.dequeue( ) queue.dequeue( ) queue.enqueue("Mr.") queue.enqueue("Saving") queue.enqueue("Forrest") queue.enqueue("Gump") queue.dequeue( ) queue.dequeue( ) queue.dequeue( )

2.

I am developing an ADT class in Java and have decided to make use of the exception processing capabilities built into Java for responding to error conditions in the ADT's operations.

At the implementation level, what aspects of Java exception processing must I include in my code? Check all that apply.

Specify a catch block for each exception that might occur within a try block

Define the exceptions

Define try blocks where exceptions might occur

Detect error conditions and throw the appropriate exception for each error 3.What is the Big-O notation for the execution time of an algorithm that is invariant with respect to the amount of data processed?