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 enqueue operation for this class. The new element is added at the tail of the queue, becoming the new tail element. Be sure to deal with the special case where the queue is empty when the call is made.

(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