Create an appropriate Java Postfix calculator class using th ealgorithm below. 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 * +
• data1data3 - data2^ data4+

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.

Algorithm:

Algorithm evaluatePostfix(postfix)

// Evaluates 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 '/' : case '^' :

operabdTwo = valueStack.pop()

operandOne = valueStack.pop()

result = the result if the operation in nextCharacter and its operands

operandOne and operandTwo

valueStack.push(result)

break

default : break //Ignore unexpected characters

}

}

return valueStack.peek()