JAVA Programing Question

The MyQueue class below implements a first-in-first-out queue. It uses a circular singly-linked list with a tail pointer as the underlying data structure, as shown in the figure below. In this figure, 2 is at the head of the queue and 7 is at the tail.

Implement the dequeue operation for this class. The element at the head of the queue is removed and returned. If the queue is currently empty then the method should throw a NoSuchElementException.

(b) 2 4 lastNode public class MyQueuecE> private Node tail = nu11; // same as 'lastNode' in the diagram private int size0; public int getSize) return size; ) //.various additional methods. private static class Node E element; Node