Which of the following is true for a successful search in the Binary Search algorithm?The middle element is equal to the search key.The middle element is greater than the search key.The middle element is less than the search key.The search key is always found in the first iteration.

What happens if the search key is not present in the array in a Binary Search algorithm?The algorithm returns the closest value.The algorithm returns 1 or an equivalent value.The algorithm keeps searching indefinitely.The algorithm returns the last element.

Which of the following is the correct way to find the middle element in a Binary Search algorithm implemented in C?mid = (low + high) / 2;mid = low + (high  low) / 2;mid = low + (high  low) / 3;mid = (low + high)  2;

How does the binary search work? a. Divides an array into two smaller subarrays and applies a linear search to each of them b. None of the above c. Compares each second element with a key recursively d. Recursively goes to the left or right subarrays and compares a key with the middle e. Compares each element with a key starting from 0`s element till the last element iteratively

In which case does the binary search algorithm perform the worst? Question 17Select one: When the array contains duplicate elements When the element is not present in the array When the array is already sorted When the element is at the middle of the array

What is the worst-case scenario for binary search?a.The target element is in the middle of the array.b.The target element is not present in the array.c.The target element is the first element of the array.d.The target element is the last element of the array.