Debugging Stack and Queue Java Code

I need help with debugging my stack and queue operations that have logical errors. Key Tasks: - Debugging the code - Correcting the push, pop, and peek operations Ideal Skills: - Strong knowledge in Java - Experience in debugging Java code - Familiarity with stack and queue operations make the Code posted below in working order. I am using Eclipse to write these two data structures. and i want to write a short test to ensure that your stack and queue work as expected.i need the working files as .java files public class MyStack<T> { private static class StackNode<T> { private T data; private StackNode<T> next; public StackNode(T data) { [login to view URL] = data; } } private StackNode<T> top; public T pop() { if (top == null) throw new EmptystackException(); T item = [login to view URL]; } top= [login to view URL]; return item; public void push(T item) { } StackNode<T> t = new StackNode<T>(item); [login to view URL] = top; top= t; public T peek() { if (top== null) throw new EmptyStackException(); return [login to view URL]; } } public boolean isEmpty() { return top== null; } A queue can also be implemented with a linked list. In fact, they are essentially the same thing, as long as items are added and removed from opposite sides. public class MyQueue<T> { private static class QueueNode<T> { private T data; private QueueNode<T> next; public QueueNode(T data) { [login to view URL] = data; } } private QueueNode<T> first; private QueueNode<T> last; public void add(T item) { } } QueueNode<T> t = new QueueNode<T>(item); if (last != null) { last.next= t; } last = t; if (first== null) { first= last; } public T remove() { } if (first== null) throw new NoSuchElementException(); T data= [login to view URL]; first= [login to view URL]; if (first == null) { last = null; } return data; public T peek() { } if (first== null) throw new NoSuchElementException(); return [login to view URL]; public boolean isEmpty() { return first== null; }