input: from typing import List
  
  def insertion_sort(arr: List[int]) -> List[int]:
      """ Sorts a given list of integers using the insertion sort algorithm.
      >>> insertion_sort([3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5])
      [1, 1, 2, 3, 3, 4, 5, 5, 5, 6, 9]
      >>> insertion_sort([])
      []
      """
      for i in range(1, len(arr)):
          key = arr[i]
          j = i - 1
          while j >= 0 and key < arr[j]:
              arr[j + 1] = arr[j]
              j = j - 1
          arr[j + 1] = key
      return arr
output:     for i in range(1, len(arr)):
          key = arr[i]
          j = i - 1
          while j >= 0 and key < arr[j]:
              arr[j + 1] = arr[j]
              j = j - 1
          arr[j + 1] = key
      return arr