What is the algorithm complexity for the sorting algorithm used in the following Python program?

list$1=[1,5,7,3,5,6]$

print$($sorted$($list$1))$

Group of answer choices

O$(1)$

O$($n log n$)$

O$($n$)$

O$($log n$)$