下列哪个二分查找代码可以正确在升序有序数组中找到第一个大于等于目标值target的下标？

int left = 0, right = nums.length - 1;
while(left <= right) {
    int mid = left + (right - left) / 2;
    if(nums[mid] >= target) {
        right = mid - 1;
    } else {
        left = mid + 1;
    }
}
return left;

int left = 0, right = nums.length - 1;
while(left <= right) {
    int mid = left + (right - left) / 2;
    if(nums[mid] >= target) {
        left = mid + 1;
    } else {
        right = mid - 1;
    }
}
return left;

int left = 0, right = nums.length - 1;
while(left < right) {
    int mid = left + (right - left) / 2;
    if(nums[mid] >= target) {
        right = mid;
    } else {
        left = mid + 1;
    }
}
return left;

int left = 0, right = nums.length - 1;
while(left <= right) {
    int mid = left + (right - left) / 2;
    if(nums[mid] < target) {
        left = mid;
    } else {
        right = mid - 1;
    }
}
return left;