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

$/*$

$*$ 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 $=$ find $($B$,$ B$+$N$,$ x$)-$ B;

$08$: if $($pos $<$ N && B$$pos$==$ x$)$

$09$: $\{$

$10$: $++$count;

$11$: $\}$

$12$: $\}$

$13$: return count;

$14$: $\}$A$.$ O$(1)$

B$.$ O$($N$)$

C$.$ O$($i$)$

D$.$ O$($log$($N$))$

E$.$ O$($sqrt$($N$))$

F$.$ O$($A$$i$)$

G$.$ O$($N$*$sqrt$($N$))$

H$.$ O$($N$*$log$($N$))$

I. O$($N$2)$

J$.$ O$($i$2)$

K$.$ none of the above are correct

Entering the single$-$letter code of your selected complexity next to the line range.

Line $10$:

Line $8-11$:

Line $6$:

Line $7$:

Line $5-11$:

Line $4-12$:

Line $1-14($entire function$)$