We proved that Insertion Sort is a $($n$2)$ algorithm and Merge Sort is a $($n lg n$)$ algorithm. That might seem to indicate that Merge Sort is always a better $($i$.$e$.,$ faster$)$ algorithm than Insertion Sort. However, given an input sequence of numbers to sort, list two reasons why Insertion Sort might actually run a lot faster $($i$.$e$.,$ fewer steps$)$ than Merge Sort. $($Running both algorithms on the same processor.$)$