Consider a simple stack implemented using ONLY this code: class stack: def __init__(self, data): self.data = data self.next = None def push(self, data): self.next = stack(self.data) self.data = data def pop(self): data = self.data self.next = self.next.next self.data = self.next.data return data Which of the following statements are flaws of this implementation: 1. This is a queue, not a stack 2. This stack doesn't allow access to arbitrary elements 3. Popping elements can underflow 4. The push method doesn't work as written 5. pop will return the data from the next node down 6. This stack can't be used for evaluating equations 1 2 3 4 5 6 2 and 5 2, 3 and 5 3 and 4 4 and 6 None of the statements are true