3. If the following statement is executed, int n-foo (1234) What is the total number of times the method foo is called (including the original call)? Why? b. 2 c. 3 d. 4 Given the timing data for the merge sort algorithm below, how long would it take to sort an array of 100, 000 values? 4. Merge Sort (ms)Selection Sort (ms) 10, 000 20, 000 30, 000 40, 000 50, 000 60, 000 31 47 62 80 97 113 772 3, 051 6, 846 12, 188 19, 015 27, 359 Consider the search method (of some class) below which is intended to return the index of the position in array a where key is found. If key is not in the array a, -1 is returned. 5. public int search (int key) int low-0; int hight-a.length-1; while (low