Step through the code for the following sample input - 1 int array []={3,37,45,120}; 2 System.out.println(LinearSearch.search(array, 3)); In the case that the search target appears at a varying index of the list, (3,37,45,120) or disappears from the list, what could be the number of operations that the above-mentioned finear search algorithm needs in the search for the given target? Please fill in the following table. Which case in Question 3 is the best case? Search target is the first itom in the list Search target is not in the list Search target is the second item in the list Search target is the third item in the list. Search target is the fourth item in the lat Which case in Question 3 is the worst case? Search target is not in the list Search target is the third item in the list Search target is the first item in the list Search target is the second item in the list Search target is the fourth item in the list