figure insertion sort def insertion_sort(a_list)for index in range( len(a_list))current_value a_list[indexposition index while position and a_list[position current_valuea_list[positiona_list[position position position a_list[positioncurrent_value a_list [ insertion_sort(a_listprint(a_listself check suppose you have the following list of numbers to sort[ which list represents the partially sorted list after three complete passes of insertion sort sorting and searching