Match the sorting definitions Bubble Sort Insertion Sort Merge Sort Selection Sort Quicksort Heapsort A. This sort joins already sorted lists into a new sorted lists. It compares the list item of each list and selects the smaller (or larger item) to join in the new list. This continuous until one list is empty when the remaining is simply added. B. This is a simple sorting algorithm that takes items from the list one by one and places them in their correct position into a new sorted list. C. This is a device and conquer algorithm which partitions a list an item called a pivot. All items smaller than the pivot are moved before it and all greater elements are moved after it. D. In this method, it determines the largest (or smallest) item of the list, moves it to the beginning (or end) of the list. This continues with the rest of the list, but accomplished this task efficiently by using a data structure which is a special type of binary tree. E. A simple sorting algorithm, it starts at the beginning and compares the first two items. If the first is greater than the second, it swaps them. It continues comparing and appropriately for each pair of adjacent elements to the end of the items. It begins again with the first two items, repeating unit no swaps occur on the last pass F The first finds the minimum value item and swaps it with the item in the first position. this is repeated on the remainder for n iterations, where n is the size of the list Which of these sorting algorithm is most efficient? Merge Sort Bubble Sort Selection Sort Insertion Sort