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;

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.

The following steps are required to implement the binary search for an array sorted in ascending order.1) 1)Initialize Pointers: - Set two pointers, `low` and `high`, initially pointing to the start and end of the array, respectively. 2) Calculate Midpoint: - Calculate the midpoint index using the formula `mid = (low + high) // 2`. 3) Compare Midpoint Element: - Compare the element at the midpoint with the target element you are searching for: - If the midpoint element is equal to the target, the search is successful, and you can return the index. - If the midpoint element is less than the target, update `low` to `mid + 1` and continue the search in the right half. - If the midpoint element is greater than the target, update `high` to `mid - 1` and continue the search in the left half. 4) Repeat: - Repeat steps 3-4 until the `low` pointer is greater than the `high` pointer. This means the search range has become empty. 5) Return Result: - If the target element is found, return its index. If the target is not found, return a sentinel value (e.g.,-1) to indicate that the element is not in the array.Which steps would require modification if the array were sorted in descending order? Step 2 Step 4 Steps 2 and 4 No modification in steps

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 the first element of the array.c.The target element is not present in the array.d.The target element is the last element of the array.Clear my choice

What is the initial step in executing a binary search on a sorted array?*1 pointA. Traverse the entire array from start to end.B. Compare the target value to the middle element.C. Sort the array in ascending order.D. Calculate the average value of the elements.

14. WRITE A PROGRAM that contains a recursive function to perform Binary Search15. (Hint: The function will need the sorted array, element to be searched, lower index and upperindex as arguments. Initially lower index will be 0 and upper index will be N-1, where N is thenumber of elements in the array. If lower index > upper index, return -1, indicating that elementis not present in the list. Otherwise, do the following:-16. Mid index is calculated as average of lower index and upper index.17. If Array’s mid index element equals item to be searched, return mid.18. If item < Array’s mid index element, call the function with upper limit changed to (mid index-1) and return the result.19. If item > Array’s mid index element, call the function with lower limit changed to (mid index+1)and return the result