CS 219: Data structure -sheet 7 Stack 1- Using a balanced Parentheses Algorithm, check if the following Expressions have balance parentheses a- If (s.length ()}==0 then x=6 b- (a(b+2))/(45+d) 2- Use Converting Infix to Postfix Algorithm to convert the following infix expression to Postfix show all steps : aAB+C/EDbA(B+C(E/(DF))H 3- Evaluate Postfix expression using stack, show all steps :a-5328+b-623+382/+23+