Can you make it so that this java code will convert to prefix instead. It still functions the same but instead will receive an infix expression from the user then reverse it before converting it to postfix. After converting to postfix it should reverse it again and that will be the final prefix expression. **The '(' and ')' should never be reversed. For example (a+b) should be reversed as (b+a) not )b+a(. package infixtopostfix; import java.util.Scanner; import java.util.Stack; public class InfixToPostfix { static int precedence(char ch) { switch (ch) { case '+': case '-': return 1; case '*': case '/': return 2; case '^': return 3; } return -1; } static String infixToPostfix(String expression) { String result = ""; Stack stack = new Stack(); String symbols; String stackContent; System.out.println("====================================================================="); System.out.format("%-10s %-20s %-10s%n", "Symbols", "Stack", "Postfix"); System.out.format("%-10s %-20s %-10s%n", "-------", "------", "-------"); for (int i = 0; i

break; } if ("N".equals(x)){ } else {System.out.println("Invalid Input. Please Try again."); } }else{ System.out.println("Invalid Input. Please Try again."); } } } } The output should look something like this:

INFLX EXPRESSION: (a+b)c FUIPPEP NIFIX EXPRES ION: c(b+a) SMBOLcblcb+a)STACKc(+(+POSTFIXcccbcbcbcbacba+cba+ INFIX EXPRESSION: (a+b)c PREFIX EXPRESSION: A+abc