In the quicksort algorithm, why is the insertion sort algorithm used when the list becomes small?

Group of answer choices

Insertion sort is more efficient when the list is small.

Using insertion sort ensures a stable sort.

It is impossible to write quicksort without using insertion sort.

Quicksort will not work on arbitrarily small lists.