Given an array with values {3,7, 4, 6, 2}, what would be the state of the array after 2 steps of the Insertion Sort algorithm (i.e., after 2 iterations of the outer loop)? {3, 4, 7, 6, 2} None of these answers are correct {2, 3, 7, 6, 4} O{3, 4, 7, 2, 6} {2 O {2, 3, 7, 4,6} {2, 3, 4, 6, 7}