Operating systems sometimes use a fixed array storage area to accommodate a pair of stacks such that one grows from the bottom (with its first item stored at index 0) and the other grows from the top...

Operating systems sometimes use a fixed array storage area to accommodate a pair of stacks such that one grows from the bottom (with its first item stored at index 0) and the other grows from the top (with its first item stored at the highest array index). As the stacks grow, the top of the stacks will move closer together.

The stacks are full when the two top elements are stored in adjacent array elements (top2 ..... topl + 1). Design, code, and test a class Double Stack that implements this data structure. Doub1eStack should support the normal stack operations (push , pop , peek , empty, etc.). Each stack method should have an additional int parameter that indicates which of the stacks (1 or 2) is being processed. For example, push(l, item) will push item onto stack 1.