Please help write the program in the problem in the first photo in C++. The last two photos show the class mentioned in the problem. Please have the program typed and not written on paper and include comments in the code to explain each part and provide screenshots of the output using the following data: 12, 22, 32, 45, 99, 8, 44, 65, 20, 72, 80, 68, 57, 55, 7.

Sec. 5.9 PR queue class based on the max-heap class implementa ported for manip cl 55 Implement a priority on of Figure 5.19. The following methods should be sup ulating the priority queue: void enqueue (int ObjectID, int priority) int dequeue ) void changeweight (int objectID, int newpriority); Method enqueue inserts a new object into the priority queue with ID num- ber Object ID and priority priority. Method dequeue removes the object with highest priority from the priority queue and returns its object ID. Method changeweight changes the priority of the object with ID number object ID to be newPriority. The type for E should be a class that stores the object ID and the priority for that object. You will need a mech- anism for finding the position of the desired object within the heap. Use an array, storing the object with ObjectID i in position i. (Be sure in your testing to keep the ObjectIDs within the array bounds.) You must also modify the heap implementation to store the object's position in the auxil- ary array so that updates to objects in the heap can be updated as well in the array functian buildHuff of Figure 5.29 manipulates hecause placing an inter-