$3)$ What advantage does a merge sort have over an insertion sort?: $*$

A$)$ It is more memory$-$efficient on arrays.

B$)$ It works on linked lists while insertion sort does not.

C$)$ It is more efficient from a runtime perspective.

D$)$ It can handle all data types.

E$)$ There is no advantage of using a merge sort.