C++ programming, please tell me the right answer and explain to me.

Given the following list of elements in an array 3, 9, 5, 2, 1,4, 8,7 what would the array look like after the first iteration (outer loop completes once) of Insertion sort? List the elements in the array with a single space between each element. Loop for i from index 0 to the size of the list -1 set j = i+1 Loop while j>e and list[j]