Please write an error-free code and all the conditions should be met. I would appreciate proper class naming conventions and not copy-pasted code. Code has to be in JAVA

Exercise 2: Convert a fully parenthesized to postfix expression Implement an algorithm to convert a fully parenthesized to postfix expression 1. Demonstrate the output by including some tests in the main () function The algorithm 1. Initialize a stack of characters to hold the operation symbols and parentheses. 2. Do If (the next input is left parenthesis) Read the left parenthesis and push it onto the stack. Else if (the next input is a number or other operand) Read the operand and write it to the output Else if (the next input is one of the operation symbols) Read the operation symbol and push it onto the stack. Else { Read and discard the next input symbol (which should be a right parenthesis). There should be an operation symbol on top of the stack, so pop this symbol and write it to the output. (if there is no such symbol, then print an error message indicating that there were too few operations in the infix expression to half). After popping the operation symbol, there should be a left parenthesis on the top of the stack, so pop and discard this left parenthesis. (if there was no left parenthesis, then the input did not have balanced parentheses, so print an error message and half) } While (there is more of the expression to read); 3. At this point, the stack should be empty. If not, print an error message indicating that the expression was not fully parenthesized. Input: (((A+7)*(B/C))-(2*D)) Output: A 7+BC/*2D*