1. Create an array A of capacity N. Implement two stacks S1 and S2 within the same array, each stack having its own top and its own push-pop operations. Elements should be pushed or popped into either of the stack as long as there is space in the array. Write a C++ program to implement the same. si S2