Stack: Stacks are a type of container with LIFO (Last In First Out) type of working, where a new element is added at one end and (top) an element is removed from that end only. Your Stack should not...

Stack:

Stacks are a type of container with LIFO (Last In First Out) type of working, where a new element is added at one end and (top) an element is removed from that end only. Your Stack should not be of the fixed sized. It should be able to grow itself. So using the class made in task 1, make a class named as
Stack, having following additional functionalities:

bool

empty()
: Returns whether the
Stack
is empty or not. Time Complexity should be: O(1)

bool

full()

:
Returns whether the
Stack
is full or not. Time Complexity should be: O(1)

int

size()
: Returns the current size of the
Stack. Time Complexity should be: O(1)

Type

top ()
: Returns the last element of the
Stack.
Time Complexity should be: O(1)

void

push(Type)
: Adds the element of type Type at the top of the stack. Time Complexity    should be: O(1)

Type

pop()
: Deletes the top most element of the stack and returns it. Time Complexity    should be: O(1)

• Write non-parameterized constructor for the above class.


• Write Copy constructor for the above class.


• Write Destructor for the above class.

Program in C++.