Question $1$

$4$ pts

$/*$

Find the first element in A that is

not also in $B.$

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

$\{$

int pos $=$;

while $($pos $<mtext\; id="EditorElement\_5856377"></mtext><mi\; id="EditorElement\_5856354">n</mi><mi\; id="EditorElement\_5856356">A</mi>$ & & find $(B,B+nB,A[pos])B+nB)$

$\{$

$\}$

$++$pos;

if $($pos $>=$ nA$)$

$\{$

pos $=-1$;

$\}$

$\}$

return pos;

$\}$

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