Which is true about sorting algorithms?

a$.$

Insertion sort is most commonly the default sorting algorithm of modern programming languages.

b$.$

The worst case running time of the quick sort algorithm is faster than the best$-$case running time of the insertion sort algorithm.

c$.$

The worst case running time of heap sort, quick sort, and merge sort is O$($NLogN$).$

d$.$

Despite having a slower worst case running time, in practice quick sort is often faster that heap sort.