4. (24 pts) The following tables list the input array (first line), output array (last line), and internal array state in sequential order for each of the sorts that we have studied in class (Selection Sort, Insertion Sort, Merge Sort, and Quicksort). The two O(n2) sorts print internal results as the last operation of their outer loops. Merge Sort prints the output array after each call to Merge. Quicksort prints after each call to Partition (of the version presented in the lecture). Array contents occupy rows in the following tables, with the top rows containing the input and proceeding down through time to the output on the bottom. There is exactly one right answer to each problem. For partial credit, please explain your reasoning in the space below. a) (4 pts) 4 A) Selection Sort B) Insertion Sort C) Merge Sort D) Quicksort Reasoning