Consider the following code:

/* * How many elements in the array A are * also in the array B? Assume B is sorted. */ int overlap (int* A, int* B, int N) { int count = 0; for (int i = 0; i < N; ++i) { int x = Ai; int pos = binarySearch (B, N, x); if (pos >= 0 && Bpos == x) { ++count; } } return count; }

For each of the line numbers or ranges of lines numbers listed below, select the closest (tightest) correct complexity from this list:

A. O(1) B. O(N) C. O(i) D. O(log(N)) E. O(sqrt(N)) F. O(Ai) G. O(N*sqrt(N)) H. O(N*log(N)) I. O(N2) J. O(i2) K. none of the above are correct

Enter the single-letter code of your selected complexity from the above choices next to the line range.

Line 10:

Lines 8-11:

Line 6:

Line 7:

Lines 6-11:

Lines 4-12:

Line 3:

Line 13:

Lines 1-14 (entire function):