SHOULD BE PROGRAMMED WITH C++

A dropout integer stack is like an ordinary stack except that it has a fixed capacity. When a push operation causes the number of elements in the stack to exceed the capacity, the push succeeds as normal but the oldest (bottom) element in the stack is discarded. Implement DropoutStack using a circular array. You can modify the static array implementation of the Stack data structure that we went through in class to make it a circular implementation. The class should have the following functionalities: Provide a menu drive main() method that makes sure that each member function of DropoutStack is working properly