Consider the task of sorting the following array of integers. 3 4 5 1 7 2 6 Show the state of the array after each iteration of the outer loop for each of the following algorithms - as presented in the handout distributed in class. Use a vertical bar () to mark the division between the sorted and unsorted portions of the array. a. Insertion sort (5 points) b. Selection sort (5 points)