[Problem 8] Let F denote an algorithm with two input arguments A and B. Argument A represents an unsorted 2-dimensional integer array with n elements (for example, A = [[5,2],[8,1],[3,6], ...]), and B represents a sorted, standard, 1-dimensional integer array with m elements. F(A, B) k = 0 n = len (A) for i from 1 to n x = A[i] [0] +A[i] [1] if x is not contained in B k = k+x return k What is the fastest running time for this algorithm, and give its upper bound (i.e O()). That is, give the upper bound for the running time of this algorithm for the most efficient implementation of this algorithm and properly justify your answer. Hint: Not all implementations lead to the fastest running time.

5. Implement the binary search function below that returns the index of the target value in an integer array. int search(int a[], int t, int l, int r);   Given the binary search function in question 5 and the array a below, list all activations when calling search(a, 19, 0 15).     -9 -5 -2 0 1 3 7 11 17 19 21 25 27 31 37 41 a           index      0      1       2       3      4       5       6      7      8      9     10    11    12    13     14    15