Consider merging the two sorted subarrays of array A = ( 8, 10, 12, 23, 5, 17, 30 ) by calling Merge(A, 1,4,7). How many key comparisons will be made? A Question 4 Given an array A = ( 23, 10, 8, 12, 36, 17,5.30), run Insertion-Sort(A) and Merge- Sort(A, 1, 8) separately and count the number of key comparisons made by each algorithm. Select the correct answer for each one. 1. 24 The number of key comparisons made by Insertion-Sort(A). 2. 16 3. 28 The number of key comparisons made by Merge-Sort(A, 1.6). 4. 64 5. 32 Consider merging the two sorted subarrays of array A = ( 8, 10, 12, 23, 5, 17, 30 ) by calling Merge(A, 1,4,7). How many key comparisons will be made? A Question 4 Given an array A = ( 23, 10, 8, 12, 36, 17,5.30), run Insertion-Sort(A) and Merge- Sort(A, 1, 8) separately and count the number of key comparisons made by each algorithm. Select the correct answer for each one. 1. 24 The number of key comparisons made by Insertion-Sort(A). 2. 16 3. 28 The number of key comparisons made by Merge-Sort(A, 1.6). 4. 64 5. 32