3. Write a program to read a list containing 3-digit integers only. Then write an insertion sort program that sorts the list on the basis of one’s digit of all elements. That is, if given list is :
[387, 410, 285, 106] then the sorted list (as per above condition) should be : [410, 285, 106, 387] “One’s digits are in sorted order (0, 5, 6, 7). For two matching one’s digits, the order remains as in the original list. # Code def insertion_sort(arr): for i in range(1,len(arr)): key = arr[i] j = […]