What is the worst case runtime complexity of the following method, assuming that the problem size N is the number of initialized elements in the perfect-size array data?

public static int getLastIndex(String[] data) { int index = 0; while (index < data.length && data[index] != null) { index++; } return index-1; } 

Group of answer choices

O(1)

O(N)

O(N²)