C++.

implement a Stack whose size can grow as elements are inserted into the stack. You will build three different implementations of this Stack. Two of these implementations will be array-based. Each of these two should take an initial capacity for the stack in the constructor. The only difference between these implementations will be what happens when the Stack is full. For the first implementation, ArrayStack, you should increase the size of the array by a constant amount. For the second implementation, DoublingArrayStack, you should double the size of the array. For the third implementation, you should implement a Stack using a Linked List.

#ifndef ABSTRACT_STACK_H #define ABSTRACT_STACK_H template  class AbstractStack { private: // data goes here public: AbstractStack(void) {} ~AbstractStack(void) {} bool isEmpty(void) {} int size(void) {} Type top throw(exception) {} Type pop() throw(exception) {} void push ( Type e ) {} }; #endif