Using the algorithm evaluatePostfix, given in the photo below, Write a class in java that evaluate each of thefollowing postfix expressions. Assume that a = 2, b = 3, c = 4, d = 5, and e = 6.

a.) a b + c * d -

5.18 The evaluation algorithm follows untel Algorithm evaluatePostfix(postfix) Evaluites a pastfir expression valueStack a new empty stack while (postfix has characters left to parse) nextCharacter nex nonblank character ofpostfix switch (nextCharacter) case variable: valueStack.push value of the variable nextCharacter) break case +: case : case: case '/case casecase: case case : operandTwo valueStack, pop() operandone valueStack, pop() result - the result of the operation in nextCharacter and its operands operandOne and operandTwo valueStack.push(result) break default: break // Ignore unexpected characters return valueStack peek )