# Priority Queue using Queue and Heapdict module in Python from queue import PriorityQueue  q = PriorityQueue()  # insert into queueq.put((2, 'g'))q.put((3, 'e'))q.put((4, 'k'))q.put((5, 's'))q.put((1, 'e'))  # remove and return # lowest priority itemprint(q.get())print(q.get())  # check queue sizeprint('Items in queue :', q.qsize())  # check if queue is emptyprint('Is queue empty :', q.empty())  # check if queue is fullprint('Is queue full :', q.full())