5) Which of the following is true about using the binary search algorithm in a sorted array with no holes and always keeping the order of the array intact? a. Binary search improves the performance of delete to O(log n) b. Binary search improves the performance of update to O(log n) c. Binary search improves the performance of search to O(log n)

Suppose an array sorted in ascending order is rotated at some pivot unknownto you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element. The complexity must be O(logN)You may assume no duplicate exists in the array."""def find_min_rotate(array):    """    Finds the minimum element in a sorted array that has been rotated.    """    low = 0    high = len(array) - 1    while low < high:        mid = (low + high) // 2        if array[mid] > array[high]:            low = mid + 1        else:            high = mid     return array[low] def find_min_rotate_recur(array, low, high):    """    Finds the minimum element in a sorted array that has been rotated.    """    mid = (low + high) // 2    if mid == low:.

Below is the exercise for unsorted arrays. True or False: For each statement below, indicate whether you think it is True or False 3) For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element 5) Because the update algorithm depends on using linear search, its performance is O(1) in the worst case scenario 6) If you search for and delete an element in an unsorted array and then shift the rest of the elements to fill the hole, the worst case performance is O(n) 7) If you search for and delete an element in an unsorted array and then move the last element to fill the hole, the worst case performance is O(n)

Write an array that matches the following requirement, and provide explanation of how you got your answer.--> Using a insertion sort on the array compared to using a selection sort requires FEWER comparisons of elements.

- Can you please provide me with the correct answer - Please don't put the answer = 25, 133, 145, 2  - i put that answer on my homework portal and it turned out to be incorrect. If you can fix it, that would be great