These statements all describe which the sort algorithm? • It is an in-place sorting algorithm. • It can sort a list of data elements considerably faster than many other sorting algorithms. It selects an element in the array to divide the array into subarrays. • The relation order of equal sort items is not upheld. 0 0 0 0 Merge Sort Radix Sort Quick sort External Sort

Please choose the answer and give the reasoning for it. The sequential search algorithm: 1. Requires the array to be ordered 2. Must always be implemented as a method 3. Uses a loop to step through an array, starting with the first element 4. Will not execute if the element is not in the array

Java-.Selection and insertion sort  3.a    Show steps of selection sort for the given array. You may need to add more rows to the table.   Selection Sort Initial value 3 2 7 5 4 8 9 10 1 Search 0 . . . end 3 2 7 5 4 8 9 10 1 Swap index 0                   Search 1 . . . end                   . . .                                                                                                                                                               3.b    Show steps of insertion sort for the given array. You may need to add more rows to the table.   Insertion Sort Initial value 3 2 7 5 4 8 9 10 1 , first item is sorted 3 2 7 5 4 8 9 10 1 , first 2 items are…

An int array stores the following values: 9 4 12 2 6 8 18 How many passes will it take for a selection sort to sort this array?