Lab: Sorting Name Fill in the table below with the time complexity of each sorting algorithm: Best Case Average Case Worst Case Bubble Sort Insertion Sort Selection Sort Merge Sort Quick Sort Selection Sort: Show the results after each pass of the outer loop. Change min only if the current element is less than the min. Circle the min chosen for each iteration before the swap. B 1 G E X M P L E Insertion Sort: Show the results after each pass of the outer loop. B 1 G E X A M P L E Insertion Sort: Show the results after each pass of the outer loop. B 1 G E X M P L E M P L E Merge Sort: Show the operation of the top level of the recursion. M E R G E E Show the top-level split of the data into Left and right. Left Right M P L E Merge Sort: Show the operation of the top level of the recursion. M E R G E Show the top-level split of the data into Left and right. Left Right Show the result of the recursive calls on Left and right. Left Right Show the result of the merge. Quick Sort: Show the result during the first execution of partition right before swapping the pivot element, D. D K A 1 L J B H F E Show the result after swapping the pivot element and draw the lines dividing the left and Right calls to quick sort. Show the result of the recursive calls on the Left and right