( 8 pts) Given an integer stack and one performs some push() operations in the order shown below: push 100);1 push(200) push(300) push(400) push (500) 1.1. What is the value of x and y below? X=p0p();Y=p0p() 1.2. After doing the two pops shown above, which value is on the top of the stack? 1.3. What is the current size of stack after step 1.2 ? 1.4. After step 1.2, what if one performs another push, push (600), then how many pop () operations are needed to make integer 200 become the top element of the stack