Problem 2 (25 points) Write the function reverse0 in valid C++ code to reverse a linked list using a stack. You must usc 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 t int data; Node* next Node* head; unsigned int size, public: class iterator int& operator const; iterator& operator ); class const iterator const int& operator'O const const iterator& operator++0: returns an iterator associated with the first element in the list iterator begin0 returns an iterator associated with the last element in the list terator end0; returns the last element in the list int pop back W returns the first element in the list int pop frontO: adds x to the end of the list void push back(const int& x) 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; The stack is implemented by the class IntStack with the following interface: class IntStack { public: W push x on the stack void push (const int &x); W pop the element from the top of the stack and store in x void pop(int& x); W return true if the stack is empty bool isEmpty) W peck the clement at the top without popping it const int& top0 Your implementation of the function reverse) should start as follows: void reverse)t IntList input; eg. 52-7 IntList output;lleg7-2->1-5 IntStack s; IntList:iterator it-input.begin0 I TODO: you code here