#python #computer science

Assume we pass the following list into the Insertion Sort function:

[1, 10, 3, 7, 9, 5]

Write the state of the list (as if it were in a print function) at the end of the iteration where index = 2.

I would try and work through this algorithm by hand first. You can always double-check your answer by writing this algorithm and running it.

Note that this question will be autograded, so please be EXACT with your answer (same spacing, brackets, commas, etc) as you would see in printing a list to the interactive shell (such as [X, Y, Z]).

def insertion_sort (a_list): for index in range (1, len(a_list)): current_value = a_list[index] position = index while position > 0 and a_list [position - 1] > current_value: a_list [position] = a_list [position - 1] position = position - 1 a_list [position] current_value PGO Motobool1 LEE // 1. Ooo Stalone-obceCzecc