Which of the following statements is true of this array? 6 23451 Insertion sort will perform more comparisons than Selection Sort. Selection Sort will move fewer elements during its execution than Insertion Sort The first comparison Selection Sort performs is comparing the 1 and the 6. The final comparison in Insertion Sort will compare the 1 and the 6. QUESTION 8 Which of the following statements is true? (Note: Please use the descriptions of these algorithms given in lecture and the textbook, not variations you find online.) Selection Sort can run in linear time if the array happens to already be sorted. Insertion Sort always takes on the order of N2 operations, no matter what the input is like. Whenever a swap is performed in Insertion Sort, all elements to the left of the swapped elements are sorted with respect to each other. Whenever a swap is performed in Selection Sort, both elements move closer to their final positions in the array. Selection Sort takes linear time overall, since it just requires one swap per array position. Selection Sort's best case performance is the same as Insertion Sort Insertion Sort, Selection Sort, and Mergesort are considered equally good (fast) sorts