Labapdt abdlessel/1T11120/LABS/ALab&ab9.pdf 12 360 Se An efficient algorithm can be done by insertion (Insertion Sort): Insert a value in the good position in the list already sorted on the left. The first element is in the good position. Check the second element, and insehe left part of the the list before him (thus the left part of the list is sorted). Repete with the other elements, until the list is fully sortede. Modify thr initial list. Calculate the number of steps. Ge Ch Ge Clou Example >>> L = [3, 4, -1, 7, 2, 5, 16, -2, 17, 7, 82, -1] s>> sort_by_insertion (L) Number of steps 38 Cro -2, -1, -1, 2, 3, 4, 5, 7, 7, 16, 17, 82] My uOttawa assignme.. desktop.ini y count 1000