Index Priority Queue

In this assignment we will extend the implementation of a minimum binary heap from tutorial week $8$ to build a data structure called a $($minimum$)$ index priority queue. In an index priority queue, the elements we store consist of two parts, a priority and an index. Think of the situation of a patient coming into the emergency room. The priority measures the severity of the patient's condition. We see patients in order of priority. The index is like the patient's name. This gives a way to refer and call up patients: "Patient Bob, the doctor is ready to see you now...".