Which is the correct algorithmic sequence for the conversion of an expression from Infix to Prefix?A. Change of every '(' (opening bracket) by ')' (closing bracket) and vice-versa.B. Reversal of an infix expression.C. Conversion of the modified expression into postfix form.D. Reversal of postfix expression.

Which is the correct algorithmic sequence for the conversion of an exp

1.	Which is the correct algorithmic sequence for the conversion of an expression from Infix to Prefix?A. Change of every '(' (opening bracket) by ')' (closing bracket) and vice-versa.B. Reversal of an infix expression.C. Conversion of the modified expression into postfix form.D. Reversal of postfix expression.
A.	A, B, C, D
B.	C, A, D, B
C.	B ,A, C, D
D.	D, B, A, C
Answer» D. D, B, A, C