.Faculty of Computer Science and Engineering Department of Computer Science Part 2. Stack Suppose that the following algorithms are implemented: - PushStack (ref s , val n ): push the value n to the stack s - PopStack(ref s , ref x ): remove the top element of the stack s and assign the data of that top element to x - EmptyStack(val s ): check whether the stack s is empty Required Questions Question 3. Imagine we have two empty stacks of integers, s1 and s2. Draw a picture of each stack after the following operations: 1: 2: 3: 4:.
