LGORITHMS ANALYSIS AND DESIGN Section1 Lecture JENIN) shboard | My courses / ALGORITHMS ANALYSIS AND DESIGN Section 1 Lecture (20201_110813150_AAUP - JENIN) / Final We Question 11 Let the list: 7, 10, 15, 25, 22, 13, 11,5,9,3, 6, 1 after applying the maxheap sort the list after the first heapify process becomes Not yet answered Marked out of 7.00 O a. 25, 22, 15, 13, 11, 10.9, 7, 6, 5, 3,1 b. 25, 22.15, 7, 10, 11, 13,9,5,6,3, 1 Flag question G. 25, 22. 15, 10.7, 13, 11, 5, 9,3,6,1 d. 25. 22, 15, 10, 13, 11.9, 7, 6, 3.5, 1 Next page Previous page Chapter E SEVE TOSHIBA