given an array a[] = {4,6,7,8,11} and key =11, what is the level of recursion?( assume binary search)

Binary search is a divide and conquer algorithm that divides the array into two halves and then searches for the key in the appropriate half. The level of recursion is determined by the number of times the array needs to be halved to find the key.

Here are the steps for the given array a[] = {4,6,7,8,11} and key = 11:

1. The initial middle element is 7 (the array is {4,6,7,8,11}). Since 7 is less than 11, we discard the left half and proceed with the right half {8,11}.

2. In the second step, the middle element is 8 (the array is now {8,11}). Since 8 is less than 11, we discard the left half and proceed with the right half {11}.

3. In the third step, the middle (and only) element is 11 (the array is now {11}). Since 11 is equal to 11, we have found the key.

So, the level of recursion in this case is 3.