Python implements the complete program of the first-in-first-out algorithm

The complete program for implementing the first-in-first-out algorithm in Python is as follows: class Queue: def init (self): self.items = [] def isEmpty(self): return self.items == [] def enqueue(self, item): self. items.insert(0,item) def dequeue(self): return self.items.pop() def size(self): return len(self.ite