please help me explain how the method works in detailed, especially part b. Thank you! ## Understanding the Min-Heap Structure in Priority QueuesIn this section, we will explore the structure and behavior of a priority queue implemented using a vertically-ordered tree called a **heap**. Particularly, we will focus on a type of heap known as a **min-heap**. In a min-heap, elements are "bubbled" up or down to maintain their vertical ordering, where elements with lower integer values (higher priorities) rise higher in the tree. ### Step-by-step Instruction to Build and Modify the HeapGiven the following string/priority pairs:- **A:6, B:10, C:11, D:7, E:4, F:5, G:12, H:2, I:8, J:3, K:1, L:9**#### Task (a):Construct the final array representation of the binary heap after all the elements are enqueued with their specified priorities. The array representation should reflect the min-heap property (elements with lesser integer values are higher in the tree). - **Expected Output Format:** ```{a:17, b:63, c:40}```1. **Insert K:1**2. **Insert H:2, bubble up** (K:1 remains root, H:2 as right child of K:1)3. **Insert J:3, bubble up** (K:1 remains root, H:2 as left child & J:3 right child of K:1)4. **Insert E:4, bubble up** (... further steps)(Continue as described for all insertions)#### Task (b):After the heap is constructed, perform two dequeue operations (remove the two elements that have the minimum priority). Then, write the final array representation of the resulting heap.1. **Remove K:1**2. **Re-organize and bubble up elements**3. **Remove H:2**4. **Re-organize and bubble up elements**By performing these operations, you'll modify the heap to maintain its min-heap structure. - **Expected Output Format:** ```{a:17, b:63, c:40}```This exercise demonstrates the dynamic nature of heaps in priority queues, affirming the balance and efficiency of the data structure in handling ordered element insertions and deletions.

To build a min-heap, we start with an empty array and add the elements one by one, in the order…

Recall the implementation of a priority queue using a vertically-ordered tree called a heap. Recall that the heap structure "bubbles" elements up and down as they are added and removed to maintain its vertical ordering. Given the following string/priority pairs: • A:6, B:10, C:11, D:7, E:4, F:5, G:12, H:2, 1:8, J:3, K:1, L:9 a) Write the final array representation of the binary heap that results when all of the above elements are enqueued (added in the given order) with the given priorities to an initially empty heap. This is a "min-heap", that is, priorities with lesser integer values are higher in the tree. Write your answer in the following format: {a: 17, b:63, c:40} b) After adding all the elements, perform 2 dequeue operations (remove-min operations) on the heap. Write the final array representation of the heap that results after the two elements are removed, in the same format.

Recall the implementation of a priority queue using a vertically-ordered tree called a heap. Recall that the heap structure "bubbles" elements up and down as they are added and removed to maintain its vertical ordering. Given the following string/priority pairs: • A:6, B:10, C:11, D:7, E:4, F:5, G:12, H:2, 1:8, J:3, K:1, L:9 a) Write the final array representation of the binary heap that results when all of the above elements are enqueued (added in the given order) with the given priorities to an initially empty heap. This is a "min-heap", that is, priorities with lesser integer values are higher in the tree. Write your answer in the following format: {a: 17, b:63, c:40} b) After adding all the elements, perform 2 dequeue operations (remove-min operations) on the heap. Write the final array representation of the heap that results after the two elements are removed, in the same format.