Write the complexity of the following code in Big-O notation: int index = -1; for (int i = 0; i < arr.length && index < 0; i++) { if (arr[i] == target) { index = i; } }