In this project you will write the code to create a data structure twoStacks that represents two stacks. Implementation of twoStacks should use only one array, i.e., both stacks should use the same array for storing elements Following functions must be supported by twoStacks Empty Slots (can be used by elther stack) Stack B 0 16 233 43 76 21 Grows StackATop StackBTop row Dual Stack push1 (int x) ->pushes x to first stack push2(int x)->pushes x to second stack pop10-pops an element from first stack and return the popped element pop20-pops an element from second stack and return the popped element Implementation of twoStack should be done using one array and should be space efficient. me To efficiently utilizes the available space you can start two stacks from two extreme corners of arr]. stack1 starts from the leftmost element, the first element in stack1 is pushed at index 0. The stack2 starts from the rightmost corner, the first element in stack2 is pushed at index (n-1). Both stacks grow (or shrink) in opposite direction. To check for overflow, all we need to check is for space between top elements of both stacks. This check is highlighted in the below code The menu that appears to the user should like this 1] Push into first stack 2] Push into second stack [3] Pop from first stack 4] Pop from second stack [5] Print top of first stack [6] Print top of second stack [7] Print contents of first stack [8] Print contents of first stack [9] Exit