Create an appropriate Java Postfix calculator class (exercise #8). Your program should accept at least five elements (data1, data2, data3, data4, data5) and will perform an appropriate postfix operation given the following scenarios:

• data1 data2 + data3 * data4 -

• data1 data2 * data3 data1 - / data4 data5 * +

Use the following values for each input:

data1 = 1;

data2 = 2;

data3 = 4

data4 = 5

data5 = 3

Ensure that your program has the required class and a test class.

Using the algorithm evaluatepostfix, given in Segment 5.18, evaluate each of the following postfix expres sions. Assume that a = 2, b=3, c = 4, d=5, and e=6. a. ab+c* d- b. ab*ca- / de* + c. a c-b^d+ 5.18 a The evaluation algorithm follows directly from these examples: Algorithm evaluate Postfix(postfix) 11 Evaluates a postfix expression. valueStack = a new empty stack while (postfix has characters left to parse) { nextCharacter = next nonblank character of postfix switch (nextCharacter) { case variable: valueStack.push(value of the variable nextCharacter) break case '+'; case '': case : case '7' case 'A' operandTwo = valueStack.pop() operandOne = valueStack.pop() result = the result of the operation in next Character and its operands operandone and operand Two valueStack.push(result) break 1*! : default: break 11 Ignore unexpected characters } } return valueStack. peek()