1. Design a method for keeping two stacks within a single linear array s[SPACESIZE] so that neither stack overflows until all of memory is used and an entire stack is never shifted to a different location within the array. Write methods pushi, push2, popl, and pop2 to manipulate the two stacks. (Hint: the two stacks grow toward each other.) 2. Transform each of the following expressions to prefix and postfix expressions. $ is exponentiation. a. (A+B)*(C$(D-E)+F)-G b. A+(((B-C)*(D-E)+F)/G)$(H-J)