2) Assume that we have one single array A of size N, where N is an even value, and that the array is not expandable. We need to implement 2 stacks using that array. Develop well-documented pseudo code that shows how these two stacks can be implemented using this single array. There are two cases you must consider: Case I: Fairness in space allocation to the two stacks is required. In that sense, if Stackl for instance use all its allocated space, while Stack2 still has some space; insertion into Stackl cannot be made, even though there are still some empty elements in the array; Case II: Space is critical; so you should use all available elements in the array if needed. In other words, the two stacks may not finally get the same exact amount of allocation, as one of them may consume more elements (if many push() operations are performed for instance into that stack first) For each of the two cases: a. Briefly describe your algorithm; b. Write, in pseudocode, the implementation of the following methods, for each of the stacks: push(), pop, size(), isEmpty and isFull(; c. What is the Big-O complexity for the methods in your solution? Explain clearly how you obtained such complexity. d. What is the Big-2 complexity of your solution? Explain clearly how you obtained such complexity. Is it possible to solve the same problem, especially for Case II, if three stacks were required? If so, do you think the time complexity will change from your solution above? You do not need to provide the answers to these questions, but you certainly need to think about them