Answer
See the explanation
Work Step by Step
The bubble sort algorithm requires \( (n - 1) \) comparisons and there are \( (n - 1) \) passes. The total comparisons is \( (n - 1)^2 \).
This matches the worst-case time complexity of Bubble Sort, which is $O(n^2)$.
