给定升序有序数组nums = [1,3,3,5,7]，目标值target=3，下列代码中能够正确返回第一个大于等于target的元素下标（即1）的是？

def find_first_ge(nums, target):
    left, right = 0, len(nums)-1
    while left <= right:
        mid = left + (right - left) // 2
        if nums[mid] < target:
            left = mid
        else:
            right = mid - 1
    return left

def find_first_ge(nums, target):
    left, right = 0, len(nums)-1
    while left < right:
        mid = left + (right - left) // 2
        if nums[mid] >= target:
            right = mid
        else:
            left = mid + 1
    return left

def find_first_ge(nums, target):
    left, right = 0, len(nums)-1
    while left <= right:
        mid = left + (right - left) // 2
        if nums[mid] < target:
            right = mid
        else:
            left = mid + 1
    return left

def find_first_ge(nums, target):
    left, right = 0, len(nums)-1
    while left <= right:
        mid = left + (right - left) // 2
        if nums[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return right