## Create a PriorityQueue class and implement a new enqueue() method to implement a

Create a PriorityQueue class and implement a new enqueue() method to implement a priority queuingdiscipline. For efficiency, priority queues are often implemented using a heap, so that both insertion and removalof items can be done in O(log n) time. However, we are going to use a simple naive method and simply insertnew items into a link list that we keep sorted by priority. Doing this means that the insertion (enqueue())operation becomes O(n), but since for a priority queue we always…