not just answer, need explain thanks

The following is a priority queue implemented as a heap array index: 01 3 4 5 6 7 values:A A letter's priority is based on its alphabetic order. So A.priority > B.priority > C.priority>.. Fill in the array after calling pop-heap once. Note, you should enter the single capital letter at the proper index. order. So A-priority>B.priority > C.priority. index 01 values Check