Give a complete implementation of a priority queue using the idea from the direct implementation.

Priority Queue ADT—A Direct Implementation
If the number of possible priorities is large, then an array of queues might be impractical. In this case, you might think of several alternatives. One possibility is to implement the priority queue as an ordinary linked list in which the data in each node contains two things: the item from the queue and the priority of that item. This implementation works, regardless of how large the priority range is. We will leave the details of the implementation as another exercise.