1. Consider an initially empty stack S stored in array S(0..3). Assume that TOP, which maintains the index for the topmost item in the stack, is initialized to 0. | ?| ?| ?| ?| The question marks in the figure indicate that the contents of the array are unknowns. (a) Show the contents of the array after performing all of the following operations: PUSH(S, 4), PUSH(S, 1), PUSH(S, 3), POP(S), PUSH(S, 8), and POP(S). Here, PUSH refers to adding a new element to the stack, and POP refers to removing an element from the stack. Clearly specify the index stored in TOP. (b) Continue from your answer in (a) and perform the following operations: PUSH(S, 14), PUSH(S, 10), PUSH(S, 32), PUSH(S, 28), and POP(S). Show the contents of the array after performing all of the preceding operations. Here, assume that you double the size of the array when you have exhausted all available locations in the array. Clearly specify the index stored in TOP