Problem 4: Insertion Sort [2 points] Insertion Sort is an algorithm that adds the first element to a "sorted" sublist and sorts one element at a time by comparing it with previously sorted elements. The algorithm can be described as follows - Proceed one element at a time from left to right (skip the first element) - Take the current element and find its insertion position in the sublist on the left by comparing it to the elements on the left sublist (which is already sorted) The algorithm always maintains sorted elements on the left. By the end of execution the whole list is sorted For instance, given the list 12,7, 9, 2,14: 12 79214 The initial array The first element is skipped, so we begin with 7 Compare 7 to 12;7