* * How many elements in the array A are * also in the array B? Assume B is sorted. 02: { 03: int count = 0; 04: 01: int overlap (int* A, int* B, int N) for (int i = 0; i < N; ++i) 05: { 06: int x = A[i]; 07: int pos = lower_bound (B, B+N, x) B%; 08: if (pos 0 && B[pos] == x) 09: { 10: ++count; 11: } 12: } 13: return count; 14: } According to the copy-and-paste technique, how would you annotate line 8 of this function by the time you had determined the complexity of lines 8-11?