This is a Java question. Please answer. Thank you!

**Algorithm in Psuedocode from 5.18:

2. Refer to algorithm in pseudo code, as documented in Section 5.18 of the Textbook and discussed in class, to evaluate each of the 3 postfix expressions, given the variable values shown below [10 pts] a = 2 b = 3 C = 4 d = 9 e = 15 (a) ab+c*d- (b) ab*ca-/de* + (c) ac-b^d+ 1. 5.18 The evaluation algorithm follows directly from these examples: Algorithm evaluate Postfix (postfix) // Evaluates a postfix expression. valueStack = a new empty stack while (postfix has characters left to parse) next character = next nonblank character of postfix switch (nextCharacter) { case variable: valueStack.push(value of the variable next character) break case '+': case '-' : case '*' : case '/' : case : operandTwo = valueStack.pop() operandone = valueStack.pop() result = the result of the operation in next Character and its operands operandone and operandTwo valueStack.push(result) break default: break // Ignore unexpected characters } return valueStack.peek ()