What does it mean when a program uses a sorting algorithm that is either O(n log(n)) or Ω(n log(n))?
a) The sorting algorithm has a worst-case time complexity of O(n log(n)) and a best-case time complexity of Ω(n log(n))
b) The sorting algorithm has a best-case time complexity of O(n log(n)) and a worst-case time complexity of Ω(n log(n))
c) The sorting algorithm has the same time complexity for both the best and worst cases
d) The sorting algorithm has a time complexity of O(n log(n))