Assume that insertion sort is being run on the below array. The algorithm is about half way through its sorting of the array. What will the array look like after the next pass of the algorithm? Note:...

(Java)

choose the correct multiple choice

Extracted text: Assume that insertion sort is being run on the below array. The algorithm is about half way through its sorting of the array. What will the array look like after the next pass of the algorithm? Note: the bold part of the array indicates the part that has already been sorted by the algorithm. int A] = { 80, 100, 110, 120, 90, 60, 120, 70}; O int A[] = { 60, 70, 80, 90, 100, 110, 120, 120 }; O int A[] = { 80, 90, 100, 110, 120, 60, 120, 70}; O int A[] = { 90, 60, 120, 70, 80, 100, 110, 120}; O int A[] = { 70, 80, 100, 110, 120, 90, 60, 120}; int A[] = { 60, 80, 100, 110, 120, 90, 120, 70};