Question 1 1 pts The insertion sort and selection sort are... O Relatively easy to code but slow to run on large datasets. O Very hard to code but fast to run on large datasets. Relatively easy to code and fast to run on large datasets. O Very hard to code and slow to run on large datasets. Question 2 1 pts Consider the following implementation of the insertion sort algorithm for an ArrayList of Strings. public static int insertSort(ArrayList list) { int count = 0; for (int i = 1; i 0; i--) { count++; if (to Insert.compareTo(list.get(3-1)) >= 0) { break; 3 3 list.add(, list.remove(i)); } return count; 3 The method returns an int which represents a statement execution count. What will this value be when the method returns if the parameter list contains the following Strings in the following order: "drive", "computer", "memory", "algorithm Question 3 1 pts Consider the following implementation of the selection sort algorithm for an Array of doubles. public static int selectSort(double[] arr) { int count = 0; for (int i = 0; i = 0; i--) { count++; if (arr[j] > val) { arrij + 1] = arr[i]; } else { break; } } arr[; + 1] = val; } return count; } The method returns an int which represents a statement execution count. What will this value be when the method returns if the parameter list is the array(3.5, 4.8, 2.1, 4.2)