I need to write some java code evaluating postfix of some expressions. I must use the object stack given to me and cant use a linkedlist. This is the method I am given: static double evaluatePostfixExpression (String expression) { Stack aStack = new Stack(); } These are a few of the expressions: e 4 3 ! + e 3 1 22 / / - +

I have already done number 1. I just need help with number 2.  Implement Stack<E> with an internal LineNodePlus<E>. You have been given the code for the StackADT<E> interface and all of the List files needed. You must come up with a new Stack.java that implements the StackADT interface and uses a LineNodesPlus internally to store the stack.  Construct test cases for the Stack (StackTest.java) to ensure it works correctly. StackADT.java public interface StackADT<E>{ // Stack class ADT     /**     * Clears the stack.     */    public void clear();     /**     * Pushes argument it onto the stack. Argument is stored in the top of the     * stack. Returns false if the stack is out of space.     *     * @param it value to be pushed onto the stack     * @return true if the value is stored     */    public boolean push(E it);     /**     * Pop and return the value at the top of the stack.     *     * @return value stored at the top of the stack     */    public E…

Here is a method for stack operation: function (int a, int b) { if ( (a less than or equal to zero) || (b less than or equal to zero)) return 0; push (b) to stack; return function (a-1, b-1) + stack.pop; } What is the final integer value returned by function call of call (7, 7) ? Must show all the work Show all the recursive calls each time function is called. Must show all the work.

Im trying to figure out a java homework assignment where I have to evaluate postfix expressions using stacks and Stringtokenizer as well as a isNumber method. when I try to run it it gives me an error. this is the code I have so far:   static double evaluatePostfixExpression(String expression){     // Write your code       Stack aStack = new Stack();       double value1, value2;     String token;     StringTokenizer tokenizer = new StringTokenizer(expression);     while (tokenizer.hasMoreTokens()) {       token = tokenizer.nextToken();       if(isNumber(expression)) {         value1 = (double)aStack.pop();         value2 = (double)aStack.pop();         if (token.equals("+")) {           aStack.push(value2+value1);         } else if (token.equals("-")) {           aStack.push(value2-value1);         } else if (token.equals("*")) {           aStack.push(value2*value1);         } else if (token.equals("/")) {           aStack.push(value2/value1);         }       }           }…