class Stack private: int size; // size of stackArray int top; I/ top of stackArray int *stackArray; public: Stack(int newSize) size newSize; // set array size stackArray-new int [size]; // make a new dynamic array top-1; // no items yet // put item on top of stack void push (int newValue){ stackArray[++top] = newvalue; /* increment top, insert item */ } // take item from top of stack int pop() { return stackArray[top-]; /* access item, decrement top */ } // look at item on top of stack int peek ) bool isEmpty() boolisFull() return stackArray [top]; / access item return (top =-1); return (top= size-1); { { b; int main() Stack aStack(10); aStack.push (20); aStack.push (40); aStack.push (60); aStack. push (80); cout