A)

B)

C)

Consider the following code that creates and initializes a queue. What is the size of the queue after three calls to ordersQueue.add0? Queue ordersQueue.add (8100); ordersQueue.add (8200); ordersQueue.add (8300); 01 O 5 03 O 0 Inserting an element in the middle of a LinkedList is more efficient than inserting an element into the middle of an ArrayList. Which of the statement is correct? It is not a true statement. Both are efficient same way. Because the ArrayList has to shift all elements after the insertion point to make room for the new element. Because the LinkedList does not keep track of a reference to the first element in the list. Because the LinkedList has to shift all elements after the insertion point to make room for the new element O Given the following code that creates and initializes a Deque. What is the value of the element at the tail of the deque? Deque String> jobsDeque new LinkedListO jobsDeque.addFirst("ABC"; ABC O null O 0o