Questions 1 and 2 refer to the incomplete definition of the SelectionSorter class below. public class SelectionSorter public SelectionSorterlint [I anArray) a anArray; public void sort)f for (int iQ kalength. 1; i++){ int minPos minimumPosition(i): swap(minPos, i //Returns the position of the smallest element //in a[from]... a(a.length-1] private int minimumPosition(int from... //Exchanges ali] with ali swaplint i, int j)... private intl) a The following segment of code is executed. SelectionSorter sorter-new SelectionSorter(a); sorter.sort() Consider arrays initialized with the values below I 12,3, 4,5, 6 II. 6, 5, 4, 3,2 III. 12, 6,1,5,4 1. Which of the following statements regarding the number of comparison made to sort the array is true? Explain. a. I takes fewer comparisons than both II and Ill b. Il takes fewer comparisons than both I and II. c. Ill takes fewer comparisons than both I and II. d. I and II require the same number of comparisons, which is different from the number of comparisons required to sort III. I, II, and IlI require the same number of comparisons. e