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

Line $10$

O$(1)$

Lines $8-11$

O$($log N$)$

Line $6$

O$(1)$

Line $7$

O$($log N$)$

Lines $5-11$

O$($N$*$log$($N$))$

Lines $4-12$

O$($N$*$log$($N$))$

Lines $1-14($entire function$)$ count;

$14$: $\}$

Line $10$

Lines $8-11$

Line $6$

Line $7$

Lines $5-11$

Lines $4-12$

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