QUESTION 2 Stack X is an empty stack. Please fill in the blanks below after tracking the activities below step by step: X.push(7) X.push(4): X.push([3): Y1 = X popo: X.push(5); X.push(2) Y2 X popo: Y3 Xpeek: Y1 = Y2 Y3 from the bottom of the stack, use space in between elements) X= your presentation of should start QUESTION 3 The worst case for the algorithm segment below (assume the file contains "n" words) is: get next word in the file for (i = 0; i<>