A Class with an Array: A stack

Implement a LIFO, Last In First Out, data structure, also known as a "stack." Create a class Stack to implement a stack and use Push() and Pop() as its primary methods adding and removing items from it. Here is the prototype for the class Stack: #define SIZE 10 class Stack { private: double data[SIZE]; int top_of_stack; // keeps track of recent pushes public: void Init(); // or we could use a constructor void Push(double item_to_push); double Pop(); }; The client creates an empty stack of doubles with: Stack stk; [login to view URL](); Then, whenever the client wants to "push" something onto the stack, it calls [login to view URL]( some_number ); and when the client wants to remove an item and look at it, it calls: cout << [login to view URL](); If the client tries to Pop() from a stack with nothing on it, then an error should be generated. If it tries to Push() so that more than SIZE (or whatever the size of data is) items would end up on the stack, it also generates an error. Design a test main that creates at least two separate stack objects and pushes and pops items from each, printing as necessary. ## Deliverables Here is an example of an acceptable main(): int main() { Stack s1, s2; int k; // Initialize stacks ------------ [login to view URL](); [login to view URL](); // Test the Stack ----- cout << [login to view URL](); [login to view URL]( 2.34 ); [login to view URL]( 3.56 ); [login to view URL]( 7.89 ); // just for fun [login to view URL]( -1.003 ); [login to view URL]( 5000700 ); [login to view URL]( 123456789.123456789 ); [login to view URL]( 1 ); [login to view URL]( 2 ); [login to view URL]( 3 ); [login to view URL]( 4 ); [login to view URL]( 5 ); [login to view URL]( 6 ); cout << "\n------------ First Stack ------------\n"; for (k=0; k<8; k++) cout << [login to view URL]() << endl; cout << "\n------------ Second Stack ------------\n"; for (k=0; k<8; k++) cout << [login to view URL]() << endl; return 0; } and associated sample run: /* ------------------- SAMPLE RUN --------------- Stack Empty ------------ First Stack ------------ 5 3 1.23457e+08 5.0007e+06 7.89 3.56 2.34 Stack Empty ------------ Second Stack ------------ 6 4 2 1 -1.003 Stack Empty Stack Empty Stack Empty ---------------------------------------------- */ Use this to test that your class works, but submit a different main and run Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.