Which is the worst case runtime for a quicksort algorithm?

Group of answer choices

O$($N$)$

O$($N$$log$($N$))$

O$($N$2)$

O$(2$N$)$