function recursiveBinarySearch(arr, target, left = 0, right = arr.length - 1) {
if (left > right) return false;
let mid = Math.floor((left + right) / 2);
if (arr[mid] === target) return mid;
if (target < arr[mid]) {
return recursiveBinarySearch(arr, target, left, mid - 1);
} else {
return recursiveBinarySearch(arr, target, mid + 1, right);
}
}