Algorithm

Please answer number 5 clearly and correctly

Thanks!

For Problems #4 through #6, consider the following pseudocode (ref: CLRSpp. 154-160): 01 HEAP SORT (A) 02 BUILD-MAX-HEAP (A) 03 for i A. length downto 2 04 exchange A [1] and Ali 05 A heapsize A heapsize 1 06 MAX-HEAPIEY (A, 1) 07 BUILD-MAX-HEAP (A) 08 A heapsize A. length 09 for i floor (A length/2) down to 1 10 MAX-HEAPIEY (A ,i) 11 MAX-HEAPIFY (A,i) 12 L 2*i 13 R 2 *i 1 14 if L A. heapsize and ALL] Ali 15 largest L 16 else 17 largest i 18 if R A. heapsize and A. [R] A [largest] 19 largest R 20 if largest i 21 exchange Ali and Allargest 22 MAX-HEAPIFY (A, largest)