Algorithms Question

I have posted this question before but i am not satisfied with the solution hence posting a third time.

Answer carefully and completely for a thumbs up

PLEASE DO NOT COPY ANOTHER EXPERTS SOLUTION AS I WILL KNOW!

Extra hint below:

32 (iv) 32 27 15 18 27 9 12 9 17 15 (6) (8)(9 (12 15) 16 As any list, a priority queue data structure can be implemented as an array or a linked list. Both implementations require O(n) time for either insertion or deletion. A more efficient implementation is a heap. It allows performing the main operations of a priority queue (insertion and deletion) in Ollogzn) time. Unsorted sequence Sorted sequence (array or linked list) (array or linked list) Heap Inserting a new element O(n) ollogzn) Deleting an element with the maxi-mum key O(n) O(log n) Complexity Summary Unsorted sequence Sorted sequence Heap Array Linked list Array Linked list element omn nserting a new))Olog.n) Deleting an element with the O(n)) 1) (ogzn) maximum key