code: def two_sum(numbers, target):
      """
      Given a list of numbers sorted in ascending order, find the indices of two
      numbers such that their sum is the given target.
  
      Using binary search.
      """
      for i, number in enumerate(numbers):
          second_val = target - number
          low, high = i + 1, len(numbers) - 1
          while low <= high:
              mid = low + (high - low) // 2
              if second_val == numbers[mid]:
                  return [i + 1, mid + 1]
  
              if second_val > numbers[mid]:
                  low = mid + 1
              else:
                  high = mid - 1
      return None
  
label_desc: Use image node_id 1 for calling a global function with example usage: two_sum(numbers, target) and returns: None, list