Task $1$: Recursive Binary Search $(5$ Marks$)$

Problem: Implement the binary search algorithm using recursion to search for an element

in a sorted array.

Instructions:

$$ Write a recursive method that searches for a target element in a sorted array.

$$ Trace the recursion: For a given input array and target value, trace the recursive calls

step$-$by$-$step, explaining what happens at each call.

$$ Test your code: Run the method with various test cases, including edge cases where the

element is at the beginning, end, or not in the array