Question: Question 11 (3 points) The MergeSort algorithm (Participation activitiy 10.6.9) would make what subsequent calls to MergeSort on the input (3, 4, 18, 9, 15,

Question 11 (3 points) The MergeSort algorithm (Participation activitiy 10.6.9) would make what subsequent calls to MergeSort on the input (3, 4, 18, 9, 15, 4)? O MergeSort(3, 4, 18) and MergeSort(9, 15, 4) O MergeSort(3, 4, 18, 9) and MergeSort(15, 4) O MergeSort(3, 4, 4) and MergeSort(18, 9, 15) O MergeSort(3, 4, 4) and MergeSort(9, 15, 18) Question 12 (2 points) How many total recursive calls to the MergeSort function would the MergeSort algorithm (Participation activitiy 10.6.9) make on the input (3, 4, 18, 9, 15, 4)? Do NOT count the original call MergeSort((3, 4, 18, 9, 15, 4)). Your Answer: Answer Question 13 (2 points) How many total recursive calls to the MergeSort function would the MergeSort algorithm (Participation activitiy 10.6.9) make on an input of 20 numbers? Do NOT count the starting call. Your Answer:
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
