Which trail uses the following search algorithms?Bubble SortSelection SortInsertion SortMerge SortQuick SortHeap SortUse the moves and comparisons columns to justify each trail's search algorithm. trialfileAlgalg1alg2alg3alg4alg5alg6Moves719634 2408712997msCompstest.txt1361test.txt954995002test.txt166719634 4995003test.txt58130147654test.txt92722216814test.txt10199528732

We should first understand the working principles of sorting algorithms 1. Merge sort, Quick sort, Hep sort are having O(n log n) avreage time complexity so: alg4, alg5, alg6 will be among these three algorithms 2. Similarly Bubble sort, Selection sort, Insertion sort are having O(n2) time complexity so alg1, alg2, alg3 will be among these sorting algorithms Next thing to ponder : Number of comparison in bubble sort, selection sort will be same but in case of selection sort there will be very less moves so alg2 -> selection sort alg3 -> bubble sort and alg1 -> insertion sort ( because there will be less no of comparisons but more number of moves) Now in quick sort and merge sort the number of comparisons will be almost same but time required for quick sort will be less , number of moves will also be less so: alg4 ->quick sort alg5 -> Merge sort now the final alg6-> heap sort , because: comparison will be less but number of moves will be more , as it is performed in a heap(or tree) Algorithm Algorithm name Why alg1 Insertion sort large time complexity, less no of comparisons but more number of moves alg2 Selection sort large time complexity, more no of comparisons but less number of moves alg3 Bubble sort large time complexity, more no of comparisons and number of moves alg4 Quick sort small time complexity, comparison will be more but number of moves will be less alg5 Merge sort small time complexity, comparison will be more and number moves will be more alg6 Heap sort small time complexity, comparison will be less but number of moves will be more