Which is true for a quicksort algorithm?

Group of answer choices

When the value at index I is less than the pivot value, the algorithm decrements I.

Quicksort algorithm's runtime is typically O$($N log N$).$

When the value at index h is greater than the pivot value, the algorithm increments h$.$

For unequal partitioning at every level, the worst$-$case runtime is O$($N$).$