The following is a priority queue implemented as a heap array: index: 01 values: A 2 3 4 5 6 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. index 01 4 values