Show the heap-based (min) priority queues in terms of which element occupies each array index location, when constructed by inserting the followin gin alphabetical order Elements: { A P R I O T Y Q U E }

Q7 and 9  Please explain your answer

Push 13 to the following min-heap and write the resulting heap array in the answer space. Write the array like a normal C++ array (e.g.: {67, 54, 123, ...}). 54 51 62 27 59 12pt ✓ Paragraph 28 ⠀ 50 Edit View Insert Format Tools Table 3 44 22 24

You're given an array A[1...7] Heap-Insert(A, 8), what is the resulting A? (9, 7, 6, 4, 1, 5, 3). If you execute Max-