********USE C++ CODE*******USE C++ CODE*********USE C++ CODE********

Write a program to implement the algorithm for evaluating postfix expressions that involve only single-digit integers and the integer operations +, -, and/. To trace the action of postfix evaluation, display each token as it is encountered, and display the action of each stack operation 1. Each digit or operator should be separated by a space, and end with 2. You should apply stack ADT in the program. You can use the Standard Template Library (STL) stack instead of Stack class defined in the text book. Here is an example how to use the STL stack push/pop/top and empty functions which will be used in this project. #include iostream #include using namespace std; int main stacknt> mystack; // Notice the element type in the stack should be specified in the angle bracket for (int i-0; i