heap array figure heap root last node heap and its underlying array the fact that heap is complete binary tree implies that there are no "holesin the array used to represent it every cell is filledfrom to - ( is in figure we'll assume in this that the maximum key (rather than the minimumis in the root priority queue based on such heap is descending-priority queue (we discussed ascending-priority queues in priority queuesheapsand adts we'll be talking about heaps in this although heaps are mostly used to implement priority queues howeverthere' very close relationship between priority queue and the heap used to implement it this relationship is demonstrated in the following abbreviated codeclass heap private node heaparray[]public void insert(node ndpublic node remove(