For this Question: Given an infix expression, your task is to convert it into postfix.

<b>Infix expression</b>: The expression of the form a operator b. When an operator is in- between every pair of operands.
<b>Postfix expression</b>: The expression of the form a b operator. When an operator is followed for every pair of operands.

Valid operators are +, - , *, /, ^. Each operand is an uppercase english alphabet. Infix expression may contains parenthesis as '(' and ')'.

See example for better understanding.The input contains a single string of infix expression.

<b>Constraints:-</b>
1 <= |String| <= 40Output the Postfix expression.Sample Input:-
((A-(B/C))*((A/K)-L))

Sample Output:-
ABC/-AK/L-*

Sample Input:-
A+B

Sample Output:-
AB+, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws IOException {

		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String s = in.readLine().trim();
		char[] express = s.toCharArray();
		StringBuilder ans = new StringBuilder("");
		Stack<Character> stack = new Stack<>();
		for(int i=0; i<express.length; i++){
			if(express[i]>=65 && express[i]<=90){
				ans.append(express[i]);
			}else if(express[i]==')'){
				while(stack.peek()!='('){
					ans.append(stack.peek());
					stack.pop();
				}
				stack.pop();
			}else if(stack.empty() || express[i]=='(' || precedence(express[i])>=precedence(stack.peek())){
				stack.push(express[i]);
			}else{
				while(!stack.empty() && stack.peek()!='(' && precedence(stack.peek())<=express[i]){
					ans.append(stack.peek());
					stack.pop();
				}
				stack.push(express[i]);
			}
		}
		while(!stack.empty()){
			ans.append(stack.peek());
			stack.pop();
		}
		System.out.println(ans);
	}

	static int precedence(char operator){
		int precedenceValue;
		if(operator=='+' || operator=='-')
			precedenceValue = 1;
		else if(operator=='*' || operator=='/')
			precedenceValue = 2;
		else if(operator == '^')
			precedenceValue = 3;
		else
			precedenceValue = -1;

		return precedenceValue;
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?