Java:

Question 2 (4 points) In terms of storage space required for a stack, using "inversely correlated" stacks can be implemented using arrays without wasting space. Briefly explain how the card game implemented in the last assignment could be improved by using this concept. As explained in the textbook (section 4.2.3), inversely correlated stacks means that "when one stack grows, the other will shrink." > Question 3 (4 points) What is the time efficiency of the following code in Big O notation where myArray is a 2 dimensional integer array of size [N][M]: for (int i = 0; i