This class must implement the provided UniquePriorityQueueADT interface and must support

the generic type T$.$ Since it implements this interface, it must include all methods that are

defined in the interface. It must use arrays as the underlying data structure to implement this

ADT. More specifically, it must use two arrays: queue of type T to store the data items and

priority of type double to store the priorities that correspond to the data items. These two arrays

must relate to one another element$-$wise, i$.$e$.$ queue$[0]$ has a priority of priority$[0],$ queue$[1]$ has

a priority of priority$[1],$ and so on$.$ Instance variable count specifies the number of data items in

the Unique Priority Queue.

The class must have the following private instance variables:

$$ private T$[]$ queue

$$ private double$[]$ priorit