input: def insertionSort(arr):
      for i in range(1, len(arr)):
          current = arr[i]
          j = i - 1
          while j >= 0 and arr[j] > current:
              arr[j + 1] = arr[j]
              j -= 1
          arr[j + 1] = current
      return arr
  
  """
  You should implement a function that sorts a list of numbers using the Insertion Sort algorithm.
  Example:
  for insertionSort([3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]) == [1, 1, 2, 3, 3, 4, 5, 5, 5, 6, 9]
  """
output:     for i in range(1, len(arr)):
          current = arr[i]
          j = i - 1
          while j >= 0 and arr[j] > current:
              arr[j + 1] = arr[j]
              j -= 1
          arr[j + 1] = current
      return arr