What is the time complexity of the Bubble Sort algorithm used in this program? (Bonus the Answer is C)*1 pointA. O(n)B. O(n log n)C. O(n^2)D. O(1)What is the value of 'n' after sorting the array?*1 pointA. 10B. 9C. 11D. sizeof(arr)If the array had all elements equal, what would be the best-case time complexity of the Bubble Sort algorithm?(Bonus Answer is A)*1 pointA. O(n)B. O(n log n)C. O(n^2)D. O(1)

What is the time complexity of Bubble Sort algorithm? a. (logN) b. O(1) c. O(N^2) d. O(NlogN) e. O(N)

The complexity of Bubble sort is ans. O(n3) O(n log n) O(n) O(log n)

If the array had only one element, how many passes would the Bubble Sort perform?*1 pointA. 0B. 1C. 5D. 10What is the value of 'n' in the main function?*1 pointA. 10B. 9C. 11D. sizeof(numbers)

What is the worstcase time complexity of the Bubble Sort algorithm?O(n)O(n log n)O(n^2)O(log n)

What is the initial array before sorting?*1 pointA. {4, 2, 7, 1, 9, 5, 8, 3, 10, 6}B. {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}C. {10, 9, 8, 7, 6, 5, 4, 3, 2, 1}D. {1, 2, 4, 5, 3, 7, 6, 8, 9, 10}If the array had initially been sorted in ascending order, how many passes would the Bubble Sort perform?*1 pointA. 0B. 1C. 5D. 10How many passes will the Bubble Sort algorithm perform on this array?*1 pointA. 5B. 9C. 10D. 45What is the array after the first pass of the Bubble Sort algorithm?*1 pointA. {1, 2, 4, 5, 3, 7, 6, 8, 9, 10}B. {2, 4, 1, 7, 5, 8, 3, 9, 6, 10}C. {4, 2, 7, 1, 9, 5, 8, 3, 10, 6}D. {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}During the third pass, what is the value of 'j' when comparing elements for swapping?*1 pointA. 0B. 1C. 2D. 8What is the worst-case time complexity of the Bubble Sort algorithm used in this program? (Bonus Answer is C)*1 pointA. O(n)B. O(n log n)C. O(n^2)D. O(1)What is the value of 'arr[5]' after the first pass?*1 pointA. 5B. 6C. 7D. 4What is the value of 'arr[2]' after the second pass?*1 pointA. 2B. 4C. 7D. 1What is the purpose of the outer loop in the Bubble Sort algorithm?*1 pointA. To iterate over each element in the array.B. To perform the sorting logic.C. To control the number of passes.D. To swap adjacent elements.What is the value of 'i' during the last pass of the outer loop?*1 pointA. 8B. 9C. 10D. 11What is the value of 'i' during the second pass of the outer loop?*1 pointA. 0B. 1C. 2D. 9If the array had been sorted in descending order initially, how many swaps would the Bubble Sort perform?*1 pointA. 10B. 15C. 20D. 25What is the space complexity of the Bubble Sort algorithm used in this program? (Bonus Answer is B)*1 pointA. O(n)B. O(1)C. O(n^2)D. O(log n)