Binary Search Floor Variation

Question

You get array, a list of integers in sorted order that can contain repeated values, together with a number target. Write a binary search over it with two possible outcomes. If target can be found, the answer is the smallest index holding it. When it does not occur, return the position of the element nearest to target among those that are not larger than it. ...