input: def sort_insertion(numbers: List[int]) -> List[int]:
      """ Sorts a list of numbers using the Insertion Sort algorithm.
      >>> sort_insertion([2, 4, 7, 3, 8, 6, 1])
      [1, 2, 3, 4, 6, 7, 8]
      >>> sort_insertion([10, 9, 8, 7, 6])
      [6, 7, 8, 9, 10]
      """
output:     for i in range(1, len(numbers)):
          key = numbers[i]
          j = i - 1
          while j >= 0 and numbers[j] > key:
              numbers[j + 1] = numbers[j]
              j -= 1
          numbers[j + 1] = key
      return numbers