Instructions C++ please a. Add the following operation to the class stackType. void reverseStack(stackType &otherStack); This operation copies the elements of a stack in reverse order onto another stack. Consider the following statements: stackType stack1; stackType stack2; The statement stack1.reverseStack(stack2); copies the elements of stack1 onto stack2 in reverse order. That is, the top element of stack1 is the bottom element of stack2, and so on. The old contents of stack2 are destroyed, and stack1 is unchanged. b. Write the definition of the function template to implement the operation reverseStack. Write a program to test the class stackType. main.cpp myStack.h //Header file: myStack.h #ifndef H_StackType  #define H_StackType   #include  #include  #include "stackADT.h"  using namespace std;   template  class stackType: public stackADT { public:     const stackType& operator=(const stackType&);      void initializeStack();     bool isEmptyStack() const;     bool isFullStack() const;     void push(const Type& newItem);     Type top() const;     void pop();     stackType(int stackSize = 100);      stackType(const stackType& otherStack);      ~stackType();      void reverseStack(stackType &otherStack); private:     int maxStackSize;      int stackTop;          Type *list;                                void copyStack(const stackType& otherStack);            }; template  void stackType::initializeStack() {     stackTop = 0; }//end initializeStack template  bool stackType::isEmptyStack() const {     return(stackTop == 0); }//end isEmptyStack template  bool stackType::isFullStack() const {     return(stackTop == maxStackSize); } //end isFullStack template  void stackType::push(const Type& newItem) {     if (!isFullStack())     {         list[stackTop] = newItem;   //add newItem to the                                      //top of the stack         stackTop++; //increment stackTop     }     else         cout << "Cannot add to a full stack." << endl; }//end push template  Type stackType::top() const {     assert(stackTop != 0);          //if stack is empty,                                      //terminate the program     return list[stackTop - 1];      //return the element of the                                     //stack indicated by                                      //stackTop - 1 }//end top template  void stackType::pop() {     if (!isEmptyStack())         stackTop--;                 //decrement stackTop      else         cout << "Cannot remove from an empty stack." << endl; }//end pop template  stackType::stackType(int stackSize)  {     if (stackSize <= 0)     {         cout << "Size of the array to hold the stack must "              << "be positive." << endl;         cout << "Creating an array of size 100." << endl;         maxStackSize = 100;     }     else         maxStackSize = stackSize;   //set the stack size to                                      //the value specified by                                     //the parameter stackSize     stackTop = 0;                   //set stackTop to 0     list = new Type[maxStackSize];  //create the array to                                     //hold the stack elements }//end constructor template  stackType::~stackType() //destructor {     delete [] list; //deallocate the memory occupied                      //by the array }//end destructor template  void stackType::copyStack(const stackType& otherStack) {      delete [] list;                     maxStackSize = otherStack.maxStackSize;             stackTop = otherStack.stackTop;                        list = new Type[maxStackSize];                              //copy otherStack into this stack     for (int j = 0; j < stackTop; j++)           list[j] = otherStack.list[j]; } //end copyStack template  stackType::stackType(const stackType& otherStack) {     list = nullptr;     copyStack(otherStack); }//end copy constructor template  const stackType& stackType::operator=                     (const stackType& otherStack) {      if (this != &otherStack) //avoid self-copy         copyStack(otherStack);     return *this;  } //end operator=          #endif stackADT.h //Header file: stackADT.h  #ifndef H_StackADT #define H_StackADT    template   class stackADT { public:     virtual void initializeStack() = 0;     virtual bool isEmptyStack() const = 0;     virtual bool isFullStack() const = 0;     virtual void push(const Type& newItem) = 0;     virtual Type top() const = 0;     virtual void pop() = 0; };          #endif