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

$02$: $\{$

$03$: int pos $=0$;

$04$: bool found $=$ false;

$05$: while $($pos $$ nA &&$\text{'}!$ found$)$

$06$:

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

$09$: $,$ else found $=$ true;

$10$: else

$11$: $\}$: if $(!$ found$)$

$13$: $\{$

$14$: $,$ pos $=-1$;

$16$: return pos;

$17$: $\}$

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?