def insertion sort( ) """sort list of comparable elements into nondecreasing order "" for in range( len( ))from to - cur [kcurrent element to be inserted = find correct index for current while and [ - curelement [ - must be after current [ja[ - - [jcur cur is now in the right place code fragment python code for performing insertion-sort on list cur no move move move no move move no move move insert no move insert move no move move insert no move done figure execution of the insertion-sort algorithm on an array of eight characters each row corresponds to an iteration of the outer loopand each copy of the sequence in row corresponds to an iteration of the inner loop the current element that is being inserted is highlighted in the arrayand shown as the cur value