Assume the following list is being sorted using the Quick Sort algorithm. Describe the next step in the quick sort algorithm in terms of its effect on the pivot, left, and right indices and the content of the list. Note: For credit, do not just give a general description of the quick sort algorithm. Describe in this specific situation, what's compared to what, whether any data is moved, and how the indices are changed. pivot [0] [1] [2] [3] [4] [5] [6] [6] [7] [8] [9] [10] 34 25 39 94 17 78 41 45 91 56 77 86 left right

Sort Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap sort and merge sort. Raw data is generated randomly. For different problem size, output the number of comparisons and moves required by various sorting algorithms When the program is running, input the problem size from the keyboard, the source data is randomly generated by the system, and then output the comparison times and movement times required by various sorting algorithms under this problem scale.    do this in C langauge ...it should ne able to do like the attached picture

3 2 5 6 4 1   In each blank, enter the list after the given iteration. Put one space between each pair of numbers. Do not put commas or any other character in your response besides the numbers and spaces. Do not put a space at the beginning or end of your response. What will the list be after the first iteration of selection sort? incorrect   What will the list be after the second iteration of selection sort? incorrect   What will the list be after the third iteration of selection sort? incorrect   What will the list be after the fourth iteration of selection sort?

In python don't import libraries