An large automotive store maintains a list of 50000 parts that are either available in the store or ready to be ordered. The list is ordered by item number. Every so often a supplier discontinues some parts or adds some new ones. Once a week the list is updated and typically a few dozen items are added or removed. After the update the list needs to be re-sorted. Which sorting algorithms should be used if performance (speed) is the primary concern? insertion sort O selection sort heap sort merge sort quick sort