Problem 2 (25 points) Write the function reverse0 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 0 const; iterator& operator++0 class const iterator const int& operator 0 const; constiterator& operatort+O: // returns an iterator associated with the first element in the list iterator begin0: // returns an iterator associated with the last element in the list iterator end) // 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); II adds x to the beginning of the list void push_front(const int& x); // returns the number of elements in the list unsigned int size0: Problem 2 (25 points) Write the function reverse0 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 0 const; iterator& operator++0 class const iterator const int& operator 0 const; constiterator& operatort+O: // returns an iterator associated with the first element in the list iterator begin0: // returns an iterator associated with the last element in the list iterator end) // 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); II adds x to the beginning of the list void push_front(const int& x); // returns the number of elements in the list unsigned int size0