Given a max-priority queue A[1..8] = <25, 10, 17, 6, 9, 12, 16, 5>, consider calling Max-Heap-Insert (A, 15). MAX-HEAP-INSERT (4, k) 1 A.heapsize

Given a max-priority queue A[1..8] = , consider calling Max-Heap-Insert (A, 15). MAX-HEAP-INSERT (4, k) 1 A.heapsize = A.heapsize + 1 2 A[A.heapsize] = =10 3 HEAP-INCREASE-KEY(A, A.heapsize, k) HEAP-INCREASE-KEY(A, i, k) 1 if k 1 and A[PARENT(i)]