Which of the following Big O notations is appropriate for the complexity of a sort algorithm?(1 point)

Answer 1

O(n), O(n log n), O(n^2), O(log n)