For this Question: Given a Prefix expression, convert it into a Infix expression.

Infix : An expression is called the Infix expression if the operator appears in between the operands in the expression. Simply of the form (operand1 operator operand2).
Example : (M+N) * (O-P)

Prefix : An expression is called the prefix expression if the operator appears in the expression before the operands. Simply of the form (operator operand1 operand2).
Example : *+MN-OP (Infix : (M+N) * (O-P) )Input contains a single string of prefix expression.

Constraints:
1 < = string length < = 20

Note :- String will only contain uppercase english letters and maths operand :- '/', '*', '+', '-'.

Print the Infix expression.Sample Input
*-A/BC-/AKL

Sample Output:
((A-(B/C))*((A/K)-L))

Sample Input
+AB

Sample Output
A+B, I have written this Solution Code: string=input()
stack=list()
for i in string[::-1]:
	if i not in ['/','*','^','+','-']:
		stack.append(i)
	else:
		stack.append('('+stack.pop()+i+stack.pop()+')')
print(stack[-1]), In this Programming Language: Python, Now tell me if this Code is compilable or not?