Consider the insertionSort(aList) implementation covered in lecture and the textbook. If the parameter aList contains the following elements:

1, 2, 3, 4, 5, 6, 7, 8, 9, 10

rearrange the order of these elements below that will cause the most statements in the insertionSort algorithm to be executed.

#python #computer science

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