Question 10 1 pts What is the Big-o notation which describes the following code: int i, j, temp; boolean swapped; for (i = 0; i arr[; + 1]) { // swap arr[j] and arr[j+1] temp = arr[i]; arr[j] = arr[; + 1 ]; arr(j + 1 ] = temp; swapped = true ; } // If no two elements were // swapped by inner loop, then break if (swapped == false) break O O(n^2) On^3) O O(n) O(nlogn)<.>