c++ programming questions:

A bubble sort requires at most _____ passes to sort an array of n items. a) n/2 b) n - 2 c) n - 1 d) n In the worst case, the insertion sort's comparison occurs _____ times. a) n b) n - 1 c) (n - 1)/2 d) n * (n - 1)/2 The quicksort is _____ in the worst case. a) O(n^2) b) O(n^3) c) O(n * log_2 n) d) O(log_2 n)