Which sorting algorithm discussed uses a modified version of a linear search? Insertion Sort Bubble Sort with Early Exit O Selection Sort O Bubble Sort Which sorting algorithm discussed shifts elements to make room for the next sorted item? Insertion Sort Bubble Sort O Selection Sort Bubble Sort with Early Exit Which two sorting algorithms discussed share the same best case run time when the items are already in sorted order? Bubble Sort with Early Exit O Insertion Sort Selection Sort Bubble Sort If there is an algorithm that uses three nested for loops: for ... for ... for ... Where each for loop traverses some percentage of the same array of length n, the efficiency of that algorithm would be said to be of the order (the in the answers represent exponentiation): On^3 On On^2