Suppose you have a sentineled, doubly-linked list class as specified in project 1 and an object of that class called numbers. The code segment below correctly performs an insertion sort on that list, but the list interactions have been removed. Using no spaces at all in your answers, fill in the missing code. You are free to use a Python interpreter and your linked list implementation for this problem. Be certain that the implementation uses as few steps as possible with this structure. for k in range (1, len (numbers)): cur = numbers. + j = k - while j > 0 and numbers. > Cur: - + j = j - 1 - try: + numbers. + except: + + numbers. Suppose you have a sentineled, doubly-linked list class as specified in project 1 and an object of that class called numbers. The code segment below correctly performs an insertion sort on that list, but the list interactions have been removed. Using no spaces at all in your answers, fill in the missing code. You are free to use a Python interpreter and your linked list implementation for this problem. Be certain that the implementation uses as few steps as possible with this structure. for k in range (1, len (numbers)): cur = numbers. + j = k - while j > 0 and numbers. > Cur: - + j = j - 1 - try: + numbers. + except: + + numbers