FIRST THREE PICTURES BELONG TO THE CODE FROM 5.2.5 AS MENTIONED IN THE CODE ON THE LAST PICTURE TO HELP YOU ANYLAZYE THE CODE. I NEED THE CODE FOR THE LAST PICTURE.

#Let's implement a binary search using a loop! For now, four search will just return True if the item is found, #False if it's not. Like our linear search, our binary search needs to #parameters: a list to search, and an item to search for. def binary_search(searchList, searchTerm): #First, the list must be sorted. searchList.sort() #10w, each iteration of the loop, we want to narrow down the part of the list to look at. So, we need to #keep track of the range we've narrowed down to so #far. Initially, that will be the entire list, from #the first index to the last. min 0 max-len (searchList) 1 #Now, we want to loop as long as our range has any #numbers left to investigate. As long as there is #more than one number between minimum and maximum, twe're not done searching. while min