int[] list = {-35,4,-50,2} and the length= 4 (binary search Algorithm) use the sorted list above and search for number 100, show the value of low, high, mid and the call. binarySearch(list, key, low, high);

def sort and_pop(x: list, i: int) -> list: x.sort() return x.pop(i) # Dan's code lst = [23, 17, 3, 13, 11, 5, 7, 2, 19, 1] lst = sort_and_pop(lst, 5) lst = sort_and_pop(lst, 2) II I| || If you run this code, you'll find that it produces an error. Surprise! According to the type contract, Dan's Code should work. But it doesn't, because the function type contract has faulty type annotations. Correct the function type contract so that it's clear from the type contract that Dan's code will not work. (Dan's Code will and should remain an incorrect use of the function!) TODO: Write a new type contract"" "

53: What sorting algorithm is this? void Sort1(string arr[], int beg, int end) { int piv index = subdivision(arr, beg, end); if (piv_index-1 > beg) { Sort1(arr, beg, piv_index-1); } if (piv_ind+1 piv) down--; if (up <= down) { tmp = arr[up]; arr[up] = arr[down]; arr[down] = tmp; up++; down --; } arr[beg] = arr[down]; arr[down] = piv; return down; %3D

Int[] list = {7,14,26,43,46,50,81} and the length= 7 (binary search Algorithm) use the sorted list above  and fill out the table for 3 different cases: Search for the value that is in the table. Search for the value that is greater than any value in the list. Search for the value that is smaller than any value in the list.