java multiple choice.

Part I. (20 pts.) l. (8)Assume an ArrayQueue object looks as follows with variables front and rear set as shown. Use the Array Queue class discussed in lecture that used a circular array implementation. 500 400 100 200 300 front rear a. What data value is returned at the next getFront function call? b. What data value was most recently enqueued? c. What will be the value of front after the next dequeue function call? d. What will be the value of rear after the next enqueue function call 2. 3) The LinkedQueue class developed in lecture implemented the QueueADT interface using a singly linked list built from the LinearNode class. How should the dequeue operation be defined for overall best run-time performance using the singly linked list implementation? a. dequeue at the head of the list b. dequeue at the tail of the list c. dequeue at head or tail as it is not relevant 3. (9) Draw a memory map at the end of the resulting code. Show the state of each private data member of LinkedQueue class head, tail, count Each node object should be listed in a box with both instance variables element and next designated. All references should either display an arrow to that which they point or word null. Use the Li class presented in lecture. Draw the final picture only