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: string=input()
stack=list()
preced={'+':1,'-':1,'*':2,'/':2,'^':3}
for i in string:
	if i!=')':
		if i=='(':
			stack.append(i)
		elif i in ['*','+','/','-','^']:
			while(stack and stack[-1]!='(' and preced[i]<=preced[stack[-1]]):
				print(stack.pop(),end="")
			stack.append(i)
		else:
			print(i,end="")
	else:
		while(stack and stack[-1]!='('):
			print(stack.pop(),end="")
		stack.pop()
while(stack):
	print(stack.pop(),end=""), In this Programming Language: Python, Now tell me if this Code is compilable or not?