Hello, I need help with the following problem programmed in C++.

a) Try both the AStack class and the LStack class from the textbook Figures 4.17, 4.18 and 4.19 and test each individual member function. Present a menu driven interface to the user. Use your own data for testing.

b) Modify the code of Figure 4.18 to implement two stacks sharing the same array as shown in Figure 4.20.

Sec. 4.2 Stacks 121 // Stack abtract class template class Stack ( private: void operator-(const Stack&) ( Stack (const Stack&) () Protect assignment // Protect copy constructor public: Stack () virtual Stack ) () // Default constructor // Base destructor // Reinitialize the stack. The user is responsible for // reclaiming the storage used by the stack elements. virtual void clear() = 0; // Push an element onto the top of the stack // it: The element being pushed onto the stack. virtual void push (const E& it)0; // Remove the element at the top of the stack. // Return: The element at the top of the stack. virtual E pop() = 0; // Return: A copy of the top element. virtual const E&topValue () const-0; // Return: The number of elements in the stack. virtual int length() const 0; )i Figure 4.17 The stack ADT. Sec. 4.2 Stacks 121 // Stack abtract class template class Stack ( private: void operator-(const Stack&) ( Stack (const Stack&) () Protect assignment // Protect copy constructor public: Stack () virtual Stack ) () // Default constructor // Base destructor // Reinitialize the stack. The user is responsible for // reclaiming the storage used by the stack elements. virtual void clear() = 0; // Push an element onto the top of the stack // it: The element being pushed onto the stack. virtual void push (const E& it)0; // Remove the element at the top of the stack. // Return: The element at the top of the stack. virtual E pop() = 0; // Return: A copy of the top element. virtual const E&topValue () const-0; // Return: The number of elements in the stack. virtual int length() const 0; )i Figure 4.17 The stack ADT