(a)Embedded hardware with solid stage storage(eg. EEPROM, flash) 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 algorithm discussed, which acheives that goal even in worse case?

(b) in terms of sorting quickl, would we ever want to use insertion sort(O(n^2)) instead of mergesort(O(nlogn))?