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

};

Question is below

Complete the code for the class SpecialQueue below, which implements a queue in terms of two

stacks. Assume that the stacks are implemented by the class IntStack with the interface from

Problem 2.

class SpecialQueue {

public:

void enqueue(const int& x) {

// TODO: you code here

}

void dequeue(int& x) {

// TODO: you code here

}

private:

IntStack inbox;

IntStack outbox;

};

I have included class IntStack above