Java please explain to thank you!

Consider the following definitions for a reference-based linked list: public class MyListNode { public object item: public MyListNode next;} public class MyList { private MyListNode head: private int numNodes: ..} Implement the method pop for the class MyList in order to include in this class the functionality of a stack. Please consider the first node of the reference-based linked list as the top of the stack. //Removes and returns the object at the top of this stack. //Returns null if this stack is empty. public object pop() {....} Assume you have a queue Q that has already been populated with data. What does the following code fragment do to the queue Q? Stack S = new Stack(): while (!Q.isEmpty()) { S.push(Q.dequeue());} while(!S.isEmpty()) { Q.enqueue(S. pop());}