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

Binary search is a divide and conquer algorithm that divides the array into two halves and then searches the key in the appropriate half. The level of recursion is determined by the number of times the array is divided until the key is found.

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

1. The middle element of the array is 7. Since 11 is greater than 7, we discard the left half of the array and consider the right half, which is {8,11}.

2. The middle element of the new array {8,11} is 8. Since 11 is greater than 8, we discard the left half and consider the right half, which is {11}.

3. The middle (and only) element of the new array {11} is 11, which is the key we are searching for.

So, the level of recursion is 3.