input: Write a function to determine the correct index for inserting a given value while maintaining sorted order.  
  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):
      for i in range(len(arr)):
          if arr[i] >= value:
              return i
      return len(arr)