Problem Statement-1
Write a C program that takes both a prefix and a postfix
expression as input and converts them into a single infix
expression using stacks and character arrays. The program
should ensure that the result is derived correctly from both
expressions, confirming that they represent the same
mathematical expression.
Example Input:
Prefix Expression: +*AB(-)/(C)DE
Postfix Expression: AB^(*)CD(E)/(-)+