IN JAVA Implement the method public void display() which displays the entries in a stack starting from the top. If the stack is empty, print “The stack is empty”. Add the method to ArrrayStack2.java. You do not need to modify StackInterface.java

USING THE FOLLOWING METHOD SWAP CODE: import java.util.*; class ListIndexOutOfBoundsException extends IndexOutOfBoundsException {     public ListIndexOutOfBoundsException(String s) {         super(s);     } } class ListUtil {     public static int maxValue(List<Integer> aList) {         if(aList == null || aList.size() == 0) {             throw new IllegalArgumentException("List cannot be null or empty");         }         int max = aList.get(0);         for(int i = 1; i < aList.size(); i++) {             if(aList.get(i) > max) {                 max = aList.get(i);             }         }         return max;     }     public static void swap(List<Integer> aList, int i, int j) throws ListIndexOutOfBoundsException {         if(aList == null) {             throw new IllegalArgumentException("List cannot be null");         }           if(i < 0 || i >= aList.size() || j < 0 || j >= aList.size()) {             throw new ListIndexOutOfBoundsException("Index out…

java  dont use others answers please follow thw istructions on the photo Thank you!!!

Need help with this Java problems. Java files are attached.     Add your code to the file ArrayStack2Lab.java. Add your tests to the main() method. Submit ArrayStack2Lab.java.   Problem 1 Implement the method public void display() which displays the entries in a stack starting from the top. If the stack is empty, print “The stack is empty”. Add the method to ArrrayStack2Lab.java. You do not need to modify StackInterface.java. Problem 2 Implement the method public int remove(int n) The method removes the n top most entries for a stack . If the stack contains less than n items, the stack becomes empty. The method returns the number of items removed. Add the method to ArrrayStack2Lab.java. You do not need to modify StackInterface.java.

Find out what happens when you just leave the stack alone.

how to create an interface in java that contains the following methods: boolean myPush(T element);  // pushes element onto the stack; returns true if element successfully pushed, false otherwise boolean myPop();  // removes the top element of the stack; returns true if element successfully popped, false otherwise T myTop();  // if the stack is not empty returns the top element of the stack, otherwise returns null String toString();  // returns contents of the stack as a single String int size();  // return number of elements in the stack then create java file that Implements your interface that you created as a linked stack, then use the driver shown in screen shot to test. below is the code for the LLNode class  public class LLNode<T> { protected LLNode<T> link; protected T info; public LLNode(T info) { this.info = info; link = null; }   public void setInfo(T info) { this.info = info; } public T getInfo() { return info; } public void setLink(LLNode<T> link) {…

in java please Create a method for the client perspective to determine if a ListInterface has the same numbers in the same order.  method header: public static boolean equivalentLists(ListInterface<Integer> numberListInterface, List<Integer> numberList)

This is java. Write the java code that takes the contents of a stack and places it in a queue and takes the contents of a queue and puts it in a stack. Your code can only use stack and queue data structure. swapStackAndQueue(stack, queue) //method call This is java.