So$,$ the correct options are:

a$.$ Quicksort runs in O$($N log $(100/99)$ N$)$

c$.$ Quicksort does not run in O$($N$^0)$

d$.$ The maximum depth of a leaf in the recursion tree $($the longest branch$)$ is approximately log$\_100$ N