Which of the following is a common modification to binary search for finding the

Which of the following is a common modification to binary search for finding the first occurrence of a target?

Which of the following is a common modification to binary search for finding the first occurrence of a target?

Step 1: Start with the binary search algorithm, which divides the search range in half each time.
Step 2: When you find the target value, do not stop searching immediately.
Step 3: Instead, continue to search in the left half of the current range to see if there is another occurrence of the target.
Step 4: If you find another occurrence in the left half, keep searching left until you can no longer find the target.
Step 5: Once you can no longer find the target in the left half, the last found index will be the first occurrence.

No concepts available.