4. How does the Selection Sort algorithm (selecting the minimum on each pass) run on the array [7, 2, 3, 6]? You should use the squares below to trace the algorithm. Start with the elements in the sequence written horizontally with 7 at the first cell, and 6 at the last cell. Show how the array looks like after each iteration of the inner loop. You may not need all the squares, so don't feel obliged to use them all. Initial Array 7 2 3 Iteration 1 Iteration 2 Iteration 3 Iteration 4 Iteration 5 Iteration 6 6