can someone pls help me with part b with explanation ?

also double check part a please ?

Problem 10 (2 points) Answer the following questions about sorting algorithms. (a) Which of the following statements is true about Mergesort Mark an "X" by the one correct answer. Onlogn) - Mergesort performs best when the original array is in sorted viergesort performs best when the original array is in reverse sorted order Mergesort performs best when the original array is in random order in random order. Mergesort performs differently depending on the pivot selection algor ently depending on the pivot selection algorithm as well as the initial configuration of keys. - Mergesort performs equally well regardless of the initial configuration of keys. (b) Which of the following sorting algorithms would run in the least amount of time on an array 10,000 integers which are already in sorted order? Mark an "X" by the best algorithm. Tree sort Insertion sort Binary insertion sort Selection sort Merge sort 1