(Solved): I Want Code C++ and Screenshot outputs Write a complete \( \mathrm{C}++ \) program for practicin ...

I Want Code C++ and Screenshot outputs

Write a complete \( \mathrm{C}++ \) program for practicing pointer-based stack to check the braces balancing, check palindrome words, convert the infix expressions to postfix expressions, evaluate the postfix expressions, and perform other different tasks. The program contains: - A complete struct Node, Push (), pop (), getTop (), display (), isEmpty0, and other related methods. - Bracing balancing checking method(s) - Palindrome word checking method(s) - Postfix conversion methods - Postfix evaluating method(s). - Any other related methods. The output of the program should be as the following: 1- Check the balancing of the braces. 2- Check whether the word is a palindrome or not. 3- Convert an infix expression to its postfix expression. 4- List the expression operators based on their precedence. 5- Evaluate a postfix expression. 6- Exit Please press any number (1-6) to continue: 1 Please enter the expression: \( (w+v-\{e-s\})\} \) The expression (w+v-\{e-s\})] has no braces balancing Please press any number (1-6) to continue: 3 Please enter the infix expression: \( x+y^{\star} z \) The postfix expression of \( x+y^{*} z \) expression is: \( x^{*} z^{*+} \) Please press any number (1-6) to continue: 2 Please enter the word: The word \( x x y \) is