The stack is implemented by the class IntStack with the following interface Write the funetion reverse) in valid C++ code to reverse a linked list using a stack. You must use a list iterator to taverse the linked list. Assume that the linked list is implemented by the class IntList with the following interface: class IntStack public class IntList // push x on the stack void push(const int & x); // pop the element from the top of the stack and store in x void pop int& x); // return true if the stack is empty bool isEmpty0; /peek the element at the top without popping it const int& top0 struct Node f int data: Node next; Node head; unsigned int size public: class iterator int& operator 0 const teratorkoperalor+0 class const iterator const int& operator 0 const; const iterator& operator++0 Your implementation of the function reverse) should start as follows W returns an iterator associated with the first element in the list iterator begin: W returns an iterator associated with the last element in the list iterator end: void reverse) IntList input; /e.g.5->1->2->7 IntList outpute.g. 7-->2 ->1-->5 IntStack s returns the last element in the list int pop back0 returns the first element in the list int pop fronto; W adds x to the end of the list void push back(const int& x); Wadds x to the beginning of the list void push frontconst int& x W returns the number of elements in the list unsigned int size0 IntList: iterator it input.begin0 II TODO: you code here