Which of the following correctly states the quick sort algorithm?

Group of answer choices

a$.$ Find the location of the smallest element.

b$.$ Move the smallest element to the beginning of the

unsorted list.

if $($the list size is greater than $1)$

$\{$

a$.$ Partition the list into four sublists.

b$.$ Quick sort sublist$1.$

c$.$ Quick sort sublist$2.$

d$.$ Quick sort sublist$3.$

e$.$ Quick sort sublist$4.$

d$.$ Combine the sorted lists.

$\}$

if the list is of a size greater than $1$

$\{$

a$.$ Divide the list into two sublists.

b$.$ Merge sort the first sublist.

c$.$ Merge sort the second sublist.

d$.$ Merge the first sublist and the second sublist.

$\}$

if $($the list size is greater than $1)$

$\{$

a$.$ Partition the list into two sublists, say lowerSublist and

upperSublist.

b$.$ Quick sort lowerSublist.

c$.$ Quick sort upperSublist.

d$.$ Combine the sorted lowerSublist and sorted upperSublist.

$\}$