How many pairs of adjacent elements are compared in a single pass of the bubble sort algorithm? n n-1 n/2 2n

How many passes does Bubble Sort make through the array in the worst-case scenario for sorting n elements? n n-1 2nn2

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)

The complexity of Bubble sort isans.O(n)O(n log n)O(log n)O(n3) Previous Marked for Review Next

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)

Attach your solution Here  for the Question(What is the array after the first pass of the Bubble Sort algorithm?)