/*

 * 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 (seqSearch(B, nB, A[pos]) >= 0) 

found = true; else ++pos; } if (!found) { pos = -1; } return pos; }

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

I believe that this question is asking how you would set a commit for line 5, and what type of Big-O notation would be used, Example line 5 /O(1) I know that's wrong but it's just an example.