Google Chrome PRAKASH Time Left 01:22:27 VAISHNAV PRIYANICA OMPRAKASH 20211004800 We have seen the implementation of a stack using an array in the class. In the implementation shown in the class, we add the first elem sition 0. next element at position 1 and so on. We always add and delete elements from the end of the list. Consider an array of size gn a stack implementation where you insert the first element at position n. the second at position n-1 etc. [2M) mplement two stacks using one array of size n. You should be able to push and pop from both the stacks in constant time. Your sta Flows if total size of both stacks exceed n. Your algorithm should detect overflow when it happens and subsequently terminate You on to give the pseudocode and not any program. [2M]