Searching Algorithms (linear search, binary search)

What is the time complexity of this occurrence counting approach?

function countOccurrences(arr, target) {
  const firstIndex = searchFirstOccurrence(arr, target);
  if(firstIndex === -1) return 0;
  const lastIndex = searchLastOccurrence(arr, target);
  return lastIndex - firstIndex + 1;
}

O(n)
O(log n)
Occurrence counting complexity is O(log n) because: 1) Uses two binary searches, 2) Each search takes O(log n) time, 3) Simple subtraction for final count, 4) More efficient than linear counting, 5) Works on sorted arrays only, 6) Constant time final calculation, 7) Better than linear scanning, 8) Optimal for frequency counting in sorted arrays.
O(n log n)
O(1)

Next Question (16/24)