operations front operationsand dequeue operations of which generated queueemptyexceptionswhich were caught and ignored what is the current size of qr- if the queue of the previous problem was implemented with an array of capacity as described in the and it never generated fullqueueexceptionwhat would be the current values of and rr- describe the output for the following sequence of deque adt operationsaddfirst( )addlast( )addlast( )addfirst( )removefirst()remove-last()first()addlast( )removefirst()last()removelast( - suppose you have deque containing the numbers ( , , , , , , , )in this order suppose further that you have an initially empty queue give pseudocode description of method that uses only and (and no other variables or objectsand results in storing the elements ( , , , , , , , )in this order - repeat the previous problem using the deque and an initially empty stack creativity - suppose you have stack containing elements and queue that is initially empty describe how you can use to scan to see if it contains certain element xwith the additional constraint that your algorithm must return the elements back to in their original order you may not use an array or linked list--only and and constant number of reference variables - give pseudo-code description for an array-based implementation of the double-ended queue adt what is the running time for each operationc-