Insertion Sort (6 points): Consider the following insertion sort implementation with a line added to print the contents of the list at the start of each inner iteration: def insertion sort (lst): for i in range(1, len(lst)): for j in range(i, o, -1): print (1st) # print list contents if 1st[j-1] >1st [j]: 1st[j-1], 1st[j] - lst[j], lst j-1] else: break WP2 Show the list contents, in order, displayed by all calls to print when insertion_sort is called with the input list [4, 3, 1, o, 2]. The first output is already filled in for you; you may not need all lines