Question 1 1 pts Consider the following definition for an array of integers. int[] a = {3, 4, 6463, 4, 7, 8, 5, 3, 2, 3, 6}; If you were to do a linear search for 7, how many comparisons would be made? You may assume the linear search algorithm stops comparing values when it finds the correct number. 05 4. 07 O 3 Question 2 1 pts The following search method is intended to implement a linear search algorithm to find the String target in the ArrayList of String values searchList. public static int search(String target, ArrayList searchList) { for (int i = 0; i someList) { for (/* missing header */) 1 if (e.equals(someList.get(i))) { return i; } return -1; } Which of the following should replace missing header so this method works as intended? int i = 0; i = ; i-- O Integer i : someList O int i = someList.size(); i > 0