$/*$

Find the first element in A that is

not also in B$.$

$A,$ int$*B,$ int $nA,$ int $nB)$

$02$: $\{$

$03$: int pos $=0$;

$04$: bool found $=$ false;

$05$: while $($pos $$ nA && $!$ found$)$

$06$: $\{$

$07$: if $($find $B,B+nB,A[pos])$

$08$: $,$ found $=,$ true;

$09$: else

$10$: $\}$

$3++$pos;

if $(!$ found$)$

$\{$

pos $=-1$

$\}$

return pos;

$\}$

According to the copy$-$and$-$paste technique, how would you annotate line $5$ of this function by the time you had determined the complexity of the entire. loop?