2. (In C) Use your implementation to convert well-balanced arithmetic expressions in infix notation into their equivalent expressions in postfix. (Separate your operands in the postfix notation using a single space) Remember the example in the book (see the table on next page).

CS 2413 - Data Structures Spring 2020 Lab 2 1. Use a stack implementation, to check that a given an arithmetic expression, that uses braces " &"' or parenthesis ""&")" or brackets ("&")" as grouping symbols, is using them in a matching and balanced way The book has an excmple function, called IsBalancel ). that takes the input string as an argument and returns if it is unbalanced or 1 if it is balanced. (Examples below are given only for illustrative purposes, you may come up with your own.) Examples, given for ilustration of outcome input ep TOOTO0101" Output: Banced Output: Not Balanced Examples of other expressions X-(C+B)/112 18+(38-14) -10 +12 144-18138-141-10112- 19/5) celsius 32 B4%) A x2 + * H) HD | PHU y ) 2. Use your implementation to convert well-balanced arithmetic expressions in infix notation into their equivalent expressions in postfix (Separate your operands in the postfix notation using a single space) Remember the example in the book (see the table on next paze). 1 of 2 A CONHH PALS DENG/ Please ABCDENGAH ABC/DENG/