Write a C program(Menu driven) to implement n stacks using a single 1-D array containing m locations with following prototypes , i) push(int i, int item, STACK *S); //pushing an item on ith stack ii) pop(int i, STACK *S);//poping an item from ith stack iii) display(S) // displaying all n stack contents For the STACK structure, the members boundary[i] and top[i] represents boundary and top respectively for the ith stack along with element represented by other member. While pushing if the particular stack is full, and if there is space available elsewhere in the array of m locations, it should shift the stacks so that space is allocated to the full stack.