input: def insertion_sort(numbers: list) -> list:
      """ Sorts a list of numbers using the Insertion Sort algorithm.
      >>> insertion_sort([2, 4, 7, 3, 8, 6, 1])
      [1, 2, 3, 4, 6, 7, 8]
      >>> insertion_sort([9, 3, 6, 2, 5])
      [2, 3, 5, 6, 9]
      """
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