In Python,

The PriorityQueue abstract data type consists of two primary functions 1. insert(key): to add a new key (where the key value indicates the priority) to the priority queue 2. del_min0: to delete the smallest key from the priority queue (smaller values indicate higher priorities in this case) Implement a class called PriorityQueueList which is a very simple (but inefficient) implementation of a priority queue. You only need to implement these two functions. You should use a Python list to store the keys (i.e. the priority values). t is likely that insert0 will be O(1) but del_min0 will be O(n) For example: Test Result pq - PriorityQueueListO 100 pq.insert(100) x = pq.del-min() print(x) pq PriorityQueueListO 5 pq.insert(15) pq.insert(5) pq.insert(25) x pq.del_minC print(x) x pq.del_minC print(x) x pq.del_minO print(x) 15 25