Write code

Requirements: Your assignment is to write and compare two implementations of a priority queue whose highest priority element is the one with the smallest key value. We define a priority queue to be an abstract data type (ADT) whose integer content specifies its priority specification. It can be implemented efficiently with a heap. However, for comparison reasons, you will implement it both with a heap and with another abstract data type, a linked list. All two implementations should implement the provided PriorityQueue interface (include implements PriorityQueue in your Java code), which means they should work with priorities that have type int and there are no corresponding items attached to the priorities. Priority Queue Implementations: 1. The first implementation uses a minimum heap. You need to modify the heap operations to keep the minimum, rather than maximum, element in the root. The comparison method should compare key fields. 2. The second implementation uses a linear linked list, whose elements are ordered by key value. Test Data and Input: Provide a test class. Start out by filling each ADT with the same set of 10,000 random elements (int). The ADTs could be filled concurrently as they are generated, or the set of random numbers could be sent to a file to be loaded into the ADTs later.