do note how we implement insertions to the end of the queue index is the first position in any list or array howeverin our implementation of queue using python listthe array index is the only place where new data elements are inserted into the queue the insert operation will shift existing data elements in the list by one position up and then insert the new data in the space created at index the following figure visualizes this processto make our queue reflect the addition of the new elementthe size is increased by oneself size + we could have used python' shift method on the list as another way of implementing the "insert at at the end of the dayan implementation is the overall objective of the exercise dequeue operation the dequeue operation is used to remove items from the queue with reference to the introduction to the topic of queuesthis operation captures the point where we serve the customer who joined the queue first and also waited the longestdef dequeue(self)data self items pop(self size - return data