Embedded hardware with solid state storage (e. g., EEPROM, ash) has a limit number of writes during its life cycle. Hence, one sorting algorithm design goal is to minimize the number of writes that are made. Of the sorting algorithms discussed, which achieves that goal even in worse case? In terms of sorting quickly, would we ever want to use insertion sort (O(n 2 )) instead of mergesort (O(nlogn))?