Question 2

 /* * How many elements in the array A are * also in the array B? Assume B is sorted. */ 01: int overlap (int* A, int* B, int N) 02: { 03: int count = 0; 04: for (int i = 0; i < N; ++i) 05: { 06: int x = A[i]; 07: int pos = binarySearch (B, N, x); 08: if (pos >= 0 && B[pos] == x) 09: { 10: ++count; 11: } 12: } 13: return count; 14: } According to the copy-and-paste technique, how would you mark up line 4 of this function by the time you had determined the complexity of lines 4-12? 

Please give full explanantion of solution so that I can compare it to my solution to comprehend its logic. I believe this is asking for what type of big O notation would be assigned to that particular line if you were only up to that line, for example.... for (int i = 0; i < n; i++) // O(1) n* =O(n^2)