What is the base case for the recursive Binary Search?
When the element is found or the range is empty
When the middle element is calculated
When the array size is halved
When the first element is reached