what is the best case as well- two part

Using big-oh notation, what is the worst-case runtime for this function? int is_sorted int *array, int n) { int i; for (i = 0; i array [i + 1]) return 0; return 1: } O(n log n) O(2n) O(1) Odlog n) O(n) On^2)