Lines $8-11$ time complexity $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$: $\}$