**C++

**PLEASE INCLUDE SCREENSHOTS OF THE PROGRAM WORKING**

Problem 2 (25 points) Write the function reverse) in valid C++ code to reverse a linked list using a stack. You must use a list iterator to traverse the linked list. Assume that the linked list is implemented by the class IntList with the following interface class IntList { private: struct Node { int data Node* next; Node* head; unsigned int size; public: class iterator! int& operator*(O) const; iterator& operatort+0; class const iterator! const int& operator*O const; const iterator& operator+0; // returns an iterator associated with the first element in the list iterator begin); // returns an iterator associated with the last element in the list iterator endO; // returns the last element in the list int pop back0; // returns the first element in the list int pop _front0; // adds x to the end of the list void push back(const int& x); // adds x to the beginning of the list voi id push front(const int& x); // returns the number of elements in the list unsigned int size)