simple sorting algorithm like selection sort or bubble sort has a worst-case of?

(A) O(1) time because all lists take the same amount of time to sort
(B) O(n) time because it has to perform n swaps to order the list
(C) O(n2) time because sorting 1 element takes O(n) time – After 1 pass through the list, either of these algorithms can guarantee that 1 element is sorted
(D) O(n3) time, because the worst case has really random input which takes longer to sort