code: def search_insert(array, val):
      """
      Given a sorted array and a target value, return the index if the target is
      found. If not, return the index where it would be if it were inserted in order.
  
      For example:
      [1,3,5,6], 5 -> 2
      [1,3,5,6], 2 -> 1
      [1,3,5,6], 7 -> 4
      [1,3,5,6], 0 -> 0
      """
      low = 0
      high = len(array) - 1
      while low <= high:
          mid = low + (high - low) // 2
          if val > array[mid]:
              low = mid + 1
          else:
              high = mid - 1
      return low
  
label_desc: Use image node_id 1 for calling a global function with example usage: search_insert(array, val) and returns: low