What is the cut-off for switching from quick sort to heap sort in the implementation of introsort?

What is the cut-off for switching from quick sort to heap sort in the

1.	What is the cut-off for switching from quick sort to heap sort in the implementation of introsort?
A.	16
B.	n<sup>2</sup>
C.	n log(n)
D.	2 log (n)
Answer» E.