need help for the true false question and multiple choice answers. It's better if the answers come with explanations.

2-4 Among the following sorting methods, which ones will be slowed down if we store the elements in a linked structure instead of a sequential structure? 1. Insertion sort; 2. Selection Sort; 3. Bubble sort; 4. Shell sort; 5. Heap sort A. 1 and 2 only B. 2 and 3 only C. 3 and 4 only D. 4 and 5 only 2-5 When selecting a sorting algorithm, which of the following factors must be taken into consideration besides the time and space complexities? I, the size of input data II, the structure used to store the data II, the stability of the algorithm IV, the initial condition of the data A. III only B. I and II only C. II, III and IV only D. I, II, III and IV 1-1 To sort N records by quick sort, the worst-case time complexity is O(NlogN). (2 point(s) ) OT F 1-2 During the sorting, processing every element which is not yet at its final position is called a "run". To sort a list of integers using quick sort, it may reduce the total number of recursions by processing the small partion first in each run. T F 1-3 If there are less than 20 inversions in an integer array, the Quick Sort will be the best method among Quick Sort, Heap Sort and Insertion Sort. OT F 2-1 During the sorting, processing every element which is not yet at its final position is called a "run". Which of the following cannot be the result after the second run of quicksort? A. 5, 2, 16, 12, 28, 60, 32, 72 B. 2, 16, 5, 28, 12, 60, 32, 72 OC. 2, 12, 16, 5, 28, 32, 72, 60 D. 5, 2, 12, 28, 16, 32, 72, 60 2-2 Given input { 321, 156, 57, 46, 28, 7, 331, 33, 34, 63 }. Which one of the following is the result after the 2nd run of the Least Signification Digit (LSD) radix sort? A. +7+321+28+34+333311564657-63 B. +7+321+28+33134+334615657-63 O C. 15628+321-33133344657-63-7 D. +7+32128-331-33344615657-63 2-3 When running internal sorting, if merge sort is chosen instead of insertion sort, the possible reason should be: (3 point(s) ) 1. The code of merge sort is shorter 2. Merge sort takes less space 3. Merge sort runs faster A. 2 only B. 3 only C. 1 and 2 D. 1 and 3