input: Write a python function to find the correct index to insert a given value in a sorted list in order to maintain the sorting.
  assert find_insertion_index([1, 2, 4, 5], 6) == 4
  assert find_insertion_index([1, 2, 4, 5], 3) == 2
  assert find_insertion_index([1, 2, 4, 5], 7) == 4
output: def find_insertion_index(arr, value):
      left, right = 0, len(arr)
      while left < right:
          mid = (left + right) // 2
          if arr[mid] < value:
              left = mid + 1
          else:
              right = mid
      return left