implement at the end please

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*() const;

iterator& operator++();

};

class const_iterator {

const int& operator*() const;

const_iterator& operator++();

};

// 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 end();

// returns the last element in the list

int pop_back();

// returns the first element in the list

int pop_front();

// 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 size();

};

The stack is implemented by the class IntStack with the following interface:

class IntStack {

public:

// 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 isEmpty();

// peek the element at the top without popping it

const int& top();

};

Your implementation of the function reverse() should start as follows:

void reverse() {

IntList input; // e.g. 5 --> 1 --> 2 --> 7

IntList output; // e.g. 7 --> 2 --> 1 --> 5

IntStack s;

IntList::iterator it = input.begin();

// TODO: you code here }