In terms of sorting quickly, would we ever want to use insertion sort $($O$($n

$2$

$))$ instead of mergesort

$($O$($nlogn$))?[2$ points$]$