What is printed by the following python algorithm? # Define a stack class in Python class Stack definit (self): self.items= def Push(self, item): self.items.append(item) def Pop(self) def return self.items == [] def size(self): return len(self.items) S return self.items.pop() isEmpty(self). myStack Stack() myStack Push(1) myStack Push(5) myStack Push(3) myStack Push(4) myStack Push(2) myStack Push(6) item = myStack.Pop() item = myStack Pop() myStack Push(item) while not myStack.isEmpty(): item= myStack.Pop() print(item) B