Classes and Stacks

1. Create a class called Polynomial that represents a polynomial as an array of terms. Each term contains a coefficient and an exponent. For instance, the term 5x3 has a coefficient 5 and an exponent 3. The class should provide the following overloaded operators: a) The addition operator (+) to add two polynomials. b) The subtraction operator (-) to subtract two polynomials. c) The multiplication operator (*) to multiply two polynomials. In addition, write a simple client program to demonstrate the correctness of the class implementation. 2. Create a Stack class template using a standard C++ array (as discussed in class). Assume that the stack has a fixed size (100 elements), and provide an implementation for the push, pop, and peek functions. Note that the push function should check for a full stack, while the pop and peek functions should check for an empty stack. Next, write a client program to convert an infix expression to a postfix one (as discussed in class), using the Stack template that you created. The program should first prompt the user to enter the infix expression, and then display the corresponding postfix expression on the screen. Assume that only single-digit numbers will be entered (i.e., you can simply use a char stack) and that the infix expression is entered correctly.