Assuming everything is declared properly, please determine the worst case complexity of the following (using the big-o notation):

while (index < sizeOfA && !done) { if (sequentialSearch(listB, sizeOfB, listA[index]) >= 0) done = true; else index++; }