Question $3$

Quicksort's partitioning algorithm uses a low index and a high index. Partitioning is complete when $q,$

a$.$ the high index is $0$

b$.$ the low index is the array size minus $1$

c$.$ the low index is greater than or equal to the high index

d$.$ the high index is greater than or equal to the low index