Question: Have the Priority Queue support decrease Key as follows: Define a nested class that implements Priority Queue. Position. The binary heap will be represented by an array of objects, in which each object stores a data item and its index. Each Priority Queue. Position object stores a reference back to the corresponding object in the array.