Answer the following questions and justify your answers

f) (10 points) The following is the Build-Max-Heap(A) procedure. BUILD-MAX-HEAP (A) 1 A.leq-size= .length 2 fori LA.length/2] downto 1 3 MAX-HEA PIFY (A,i) Rewrite Build-Max-Heap(A) into Build-Min-Heap(A) to build a min-heap. 8) (5 points) Execute your procedure Build-Min-Heap(A) to the array A . Provide what A becomes after the execution of Build-Min-Heap(A) and draw the resulting heap. You must provide the representation as an array and a heap You may draw by hand the resulting heap, take a picture of your drawing, and insert it in this file. h) (15 points) Analyze the time complexity of your Build-Min-Heap(A) procedure. ) (25 points) Review in the textbook the proof of correctness of Build-Max-Heap to howldemonstrate that your Build-Min-Heap(A) is correct. (Use the same method/framework used by the author of the textbook)