Part A) 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 = Ai;

07: int pos = seqOrderedSearch (B, N, x);

08: if (pos >= 0 && Bpos == x)

09: {

10: ++count;

11: }

12: }

13: return count;

14: }

Part B) 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

Line 10

Lines 8-11

Line 6

Line 7

Lines 6-11

Lines 4-12

Line 3

Line 13

Lines 1-14

Please provide Answer (letter) selection for each Line(s) listed above. Thank you.