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

05: {

06: int' x = A [i] ;

07: int pos = find (B, B+N, x) - B;

08: if pos

09: {

10: ++count;

11: }

12: }

13: return count;

14: }

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

For each of the line numbers or ranges of lines numbers listed below, select the closest (tightest) cc A. 0(1) B. O(N) CO() D. O(log(N)) E. O(sqrt(N)) F. O(A DJ) G. O(N'sqrt(N)) H.O(N"log(N)) 1.0(N2) 1.0112) K. none of the above are correct Entering the single-letter code of your selected complexity next to the line range