can be used to remove the front element (the last element of the listrecall that this also means that enqueue will be (nand dequeue will be ( completed implementation of queue adt class queuedef __init__(self)self items [def is_empty(self)return self items =[def enqueue(selfitem)self items insert( ,itemdef dequeue(self)return self items pop(def size(self)return len(self itemsself check suppose you have the following series of queue operationsq queue( enqueue('hello' enqueue('dog' enqueue( dequeue(what items are left in the queue 'hello''dog 'dog' 'hello' 'hello''dog' simulationhot potato one of the typical applications for showing queue in action is to simulate real situation that requires data to be managed in fifo manner to beginlet' consider the children' game hot potato in this game (see figure children line up in circle and pass an item from neighbour to neighbour as fast as they can at certain point in the gamethe action is stopped and the child who has the item (the potatois removed from the circle play continues until only one child is left basic data structures