Which of the following sorting algorithm will be preferred when the size of partition is between 16 and 2 log(n) while implementing introsort?

• A. quick sort
• B. insertion sort
• C. heap sort
• D. merge sort