NEED HELP ASAP!!

Write pseudocode to check 2 stack full conditions for following description:- How can you implement two stacks in a single array, where no stack overflows until no space left in the entire array space? Analysis: An array has two ends, so each of the two stacks may grow from an end in the array. Since two stacks are empty at first, so indexes of top items are initialized as -1 and 10 at first. When items are pushed into first stack, it grows from left to right. Similarly, the second stack grows from right to left when items are items are pushed into it.