Add the following operation to the Class StackClass: void reverseStack(StackClass otherStack); This operation copies the elements of a stack in reverse order onto another stack. Consider the following statements: StackClass stack1; StackClass stack2; The statement stack1.reverseStack(stack2); copies the elements of stack1 onto stack2 in the reverse order. That is, the top element of stack1 is the bottom element of stack2, and so on. The old contents of stack2 are destroyed and stack1 is unchanged. Write the definition of the method to implement the operation reverseStack. Also write a program to test the method reverseStack. In StackClass.java, please finish method - public void reverseStack(StackClass otherStack) and testing main program – Problem53.java.  Note: java programming, please use given outline code public class Problem53{ publicstaticvoidmain(String[] args){ StackClass intStack = newStackClass(); StackClass tempStack = newStackClass();   } }      public interface StackADT { publicvoidinitializeStack();   publicbooleanisEmptyStack(); //Method to determine whether the stack is empty. // Returns true if the stack is empty;   publicbooleanisFullStack(); //Method to determine whether the stack is full. //Postcondition: Returns true if the stack is full;   publicvoidpush(TnewItem) throwsStackOverflowException; //Method to add newItem to the stack //The stack exists and is not full //The stack is changed and newItem // is added to the top of stack // If the stack is full, the method // throws StackOverflowException publicTpeek() throwsStackUnderflowException; //Method to return a reference to the top element of //Precondition: The stack exists and is not empty. //Postcondition: If the stack is empty, the method // throws StackUnderflowException; // otherwise, a reference to the top // element of the stack is returned publicvoidpop() throwsStackUnderflowException; //Method to remove the top element of the stack //The stack exists and is not empty //The stack is changed and the top // element is removed from the stack // throws StackUnderflowException }   public class StackClass implements StackADT { privateintmaxStackSize;  privateintstackTop;  privateT[] list;    //Create an array of size 100 to implement the stack. //Postcondition: The variable list contains the base // address of the array, stackTop = 0, // and maxStackSize = 100. publicStackClass() { maxStackSize = 100; stackTop = 0;  list = (T[]) new Object[maxStackSize];  } //Constructor with a parameter //Create an array of size stackSize to implement the //stack. //Postcondition: The variable list contains the base // address of the array, stackTop = 0, // and maxStackSize = stackSize publicStackClass(intstackSize) { if (stackSize <= 0) { System.err.println("The size of the array to " + "implement the stack must be " + "positive."); System.err.println("Creating an array of size 100."); maxStackSize = 100; } else maxStackSize = stackSize;  stackTop = 0;  list = (T[]) new Object[maxStackSize];  }   publicvoidinitializeStack() { for (inti = 0; i < stackTop; i++) list[i] = null; stackTop = 0; } //Method to determine whether the stack is empty. //Returns true if the stack is empty; // otherwise, returns false. publicbooleanisEmptyStack() { return (stackTop == 0); } //Method to determine whether the stack is full //Returns true if the stack is full; // otherwise, returns false publicbooleanisFullStack() { return (stackTop == maxStackSize); } //Method to add newItem to the stack. //Precondition: The stack exists and is not full. //Postcondition: The stack is changed and newItem // is added to the top of stack. // throws StackOverflowException publicvoidpush(TnewItem) throwsStackOverflowException { if (isFullStack()) thrownewStackOverflowException(); list[stackTop] = newItem;  stackTop++;  } //Method to return a reference to the top element of //the stack. //Precondition: The stack exists and is not empty. //Postcondition: If the stack is empty, the method // throws StackUnderflowException; // element of the stack is returned. publicTpeek() throwsStackUnderflowException { if (isEmptyStack()) thrownewStackUnderflowException(); return (T) list[stackTop - 1]; } //Method to remove the top element of the stack. //Precondition: The stack exists and is not empty. //Postcondition: The stack is changed and the top // element is removed from the stack. // throws StackUnderflowException publicvoidpop() throwsStackUnderflowException { if (isEmptyStack()) thrownewStackUnderflowException(); stackTop--;  list[stackTop] = null; } publicvoidreverseStack(StackClass otherStack) {     } }     public class StackException extends RuntimeException { publicStackException() { } publicStackException(Stringmsg) { super(msg); } }     public class StackOverflowException extends StackException { publicStackOverflowException() { super("Stack Overflow"); } publicStackOverflowException(Stringmsg) { super(msg); } }     public class StackUnderflowException extends StackException { publicStackUnderflowException() { super("Stack Underflow"); } publicStackUnderflowException(Stringmsg) { super(msg); } }

don't use others answers java 1. Write a generic static method that takes a Stack of any type element as a parameter, pops each element from the stack, and prints it. It should have a type parameter that represents the Stack’s element type.

Stack ADT Implement a program in C++ that has the following three parts and each does the following: 1. Implements in C++, the specification of a Stack ADT with all the Main and Helper behaviors (save the file as StackADT.h) 2. Implements in C++, all the necessary methods (behavior) of the StackADT (save the file as StackADT.cpp) 3. Implements in C++, a main function (the client or application program) that creates and uses Stack objects (save the file as StackMain.cpp). This main function should be able to do the following: a. It should be able to read a given text file as input, b. It should be able to get each input value from the input file (one word at a time) and store it (push) on the StackADT object until it stores all the words from the input file. c. It should be able to retrieve an item from the stack and 1) display it on the screen, as well as 2) write it to an output file, and then delete (pop) that item from the stack, and repeat this process until it retrieves all the…

Modify the Java class for the abstract stack type shown belowto use a linked list representation and test it with the same code thatappears in this chapter. class StackClass {private int [] stackRef;private int maxLen,topIndex;public StackClass() { // A constructorstackRef = new int [100];maxLen = 99;topIndex = -1;}public void push(int number) {if (topIndex == maxLen)System.out.println("Error in push–stack is full");else stackRef[++topIndex] = number;}public void pop() {if (empty())System.out.println("Error in pop–stack is empty"); else --topIndex;}public int top() {if (empty()) {System.out.println("Error in top–stack is empty");return 9999;}elsereturn (stackRef[topIndex]);}public boolean empty() {return (topIndex == -1);}}An example class that uses StackClass follows:public class TstStack {public static void main(String[] args) {StackClass myStack = new StackClass();myStack.push(42);myStack.push(29);System.out.println("29 is: " + myStack.top());myStack.pop();System.out.println("42 is:…