$/$

Find the first element in A that is

not also in B$.$

$*/$

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

$\{$

int pos $=0$;

bool found $=$ false;

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

$\{$

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

found $=$ true;

else

$++$ pos;

$3$

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?