Using C

For Reference:

Ex. 1,2,3

Implement the following algorithms in code using the stack and queue methods developed in exercises 1, 2 and 3: 6. a. Parentheses/equation validation Infix to postfix expression conversion c. Postfix equation evaluation Create a text file with the following data input. (5+3) 24)#3)) (2+3)*C(8*9)/2) Using your programs, first do a parentheses check. If the equation passes the parentheses check, convert the equation to postfix, then evaluate the postfix equation