Among Selection Sort, InsertionSort, MergeSort, QuickSort, and HeapSort, which algorithm would you use for each list-sorting situation below? Justify your answers. A question might have multiple right answers, but each definitely has at least one wrong answer. (a) The list has several hundred records. The records are quite long, but the keys are very short.

Answer and Explanation:

a)The list has several hundred records. The records are quite long, but the keys are very short. ->Selection Sort or Insertion sort.Because the data to be sorted in the memory of the computer and need to be accessed as fast as it can. In this case the keys are small so can be easily compared with each other and can be placed in correct position.The small size of the key helps us in this case to use insertion or selection sort.

i think its d if im not mistaken