1. 
   
   1. Consider a MinHeap H1 and take the input of integers as follows and print the H1 based on the index  

2. 

   
   

                                                                                                                                        

          2.Print the largest element of H1.

          3.Delete the smallest element of H1 and display the updated H1.

          4.Print the sum of the largest and smallest elements of the updated H1.

          5.Print the index of the smallest element of the updated H1.

          6.Consider the MaxHeap H2 and take the input of integers as follows and print the H2 based on the index.

   

   
   

                                                                      

          7.Print the sum of all elements of the H2.

          8.Add element 45 to H2 and print the updated H2.

          9.Delete element 45 from H2 and print the updated H2.

          10.Print the last element of the updated H2.
    

Transcribed Image Text:

N Access your Bearcat X APP DES: PATTERNS X Assignment-05 (He X (16) Oh Baby M Inbox (1,654) - pruc X Dashboard nwmissouri.instructure.com/courses/47644/assignments/731450 X + > EJ 1. Consider a MinHeap H1 and take the input of integers as follows and pri on the index Problems: 25 26 44 Type here to search 14 35 35 10 31 33 33 42 19 27 27 T OneDrive Personal Up to date 1:08 PM 10/15/2022 N Access your Bearcat X APP DES: PATTERNS X Assignment-05 (He X (16) Oh Baby M Inbox (1,654) - pruc X Dashboard nwmissouri.instructure.com/courses/47644/assignments/731450 X + > EJ 1. Consider a MinHeap H1 and take the input of integers as follows and pri on the index Problems: 25 26 44 Type here to search 14 35 35 10 31 33 33 42 19 27 27 T OneDrive Personal Up to date 1:08 PM 10/15/2022