I want C++ code, and a different, unique and simplified solution with a screenshot of the output

Write a complete 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 O, display O, isEmpty(), and other related methods. - Bracing balancing checking method(s) - Palindrome word checking method(s) - Postfix conversion methods - Postfix cvaluating method(s). - Any other related methods. The output of the program should be as the following: /****k**k*k** Some Stack Applications **k*****k** 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{es})} The expression (w+v-\{e-s })} has no braces balancing Please press any number (1-6) to continue: 3 You are working on Converting infix to postfix expressions Please enter the infix expression: x+yz The postfix expression of x+yz expression is: xyz+ Please press any number (1-6) to continue: 2 Please enter the word: The word xxx is