ou are being asked to design a new stack that Google wants to name as Am$-$

phisbaena $($why on earth would they want to call it such a weird name!!$).$ Amphisbaena

will actually be two stacks on a single array of size n$,$ without the two overflowing each

other unless there are n elements in total among both stacks. In plain English, explain

a data structure that will dynamically and efficiently hold two stacks together in a single

structure.