Please help using C++.

Thank you.

Problem 1 Write a program to evaluate a postfix ex Input: a postfix expression. E.g. 3 5+ Output: the result of the expression. E.g. the result for the above input is 8. Note: You must use the stack to implement this task. And please give the stack solutions for both the following implementations: (a) Implement the array-based stack (b) Implement the pointer-based stack ression Test your program using the following expressions: 1. 35+ 2. 35+6 3. 356+ 4. 356 8-2/+ 5. 12 20 +16/ Problem 2. Write a program to convert an infix expression to a postfix expression. Input: an infix expression Output: the corresponding postfix expression Note: You must use the stack to implement this task. And you can use any one of the above stack implementations. Test your program using the following expressions: 1. (a + b) c