I need answer soonly, thank you

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 O B. 2, 16, 5, 28, 12, 60, 32, 72 O C. 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-331-34-33-4615657-63 C. +156+28+321331-33-34-46-57-63-7 D. +732128-33133344615657-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 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 III, 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