Plaese help me with this question. Thank you.
The Program For this assignment, you will write two implementations of a Priority Queue. For this ADT, removal operations always return the object in the queue of highest priority that has been in the queue the longest. That is, no object of a given priority is ever removed as long as the queue contains one or more object of a higher priority. Within a given priority FIFO order must be preserved Your implementations will be: 1. Ordered Array 2. Unordered Array Both implementations must have identical behavior, and must implement the PriorityQueue interface (provided). The implementations must have two constructors, a default constructor with no arguments that uses the DEFAULT MAX CAPACITY constant from the PriorityQueue interface, and a constructor that takes a single integer parameter that represents the maximum capacity of the priority queue. The PriorityQueue interface follows: / The PriorityQueue ADT may store objects in any order. Hovever removal of objects from the PQ must follow specifie criteria. The object of highest priority that has been in the PQ longest must be the object returned by the remove () method. FIFO return order must be preserved for objects of identical priority Ranking of objects by priority is determined by the Comparablec interface. All objects inserted into the PQ must implement this interface package data structures: import java.util.Iterator The Program For this assignment, you will write two implementations of a Priority Queue. For this ADT, removal operations always return the object in the queue of highest priority that has been in the queue the longest. That is, no object of a given priority is ever removed as long as the queue contains one or more object of a higher priority. Within a given priority FIFO order must be preserved Your implementations will be: 1. Ordered Array 2. Unordered Array Both implementations must have identical behavior, and must implement the PriorityQueue interface (provided). The implementations must have two constructors, a default constructor with no arguments that uses the DEFAULT MAX CAPACITY constant from the PriorityQueue interface, and a constructor that takes a single integer parameter that represents the maximum capacity of the priority queue. The PriorityQueue interface follows: / The PriorityQueue ADT may store objects in any order. Hovever removal of objects from the PQ must follow specifie criteria. The object of highest priority that has been in the PQ longest must be the object returned by the remove () method. FIFO return order must be preserved for objects of identical priority Ranking of objects by priority is determined by the Comparablec interface. All objects inserted into the PQ must implement this interface package data structures: import java.util.Iterator
