1. Write this following code (divide and conquer) into your Python Visual Studio, then run the program def bsearch(list, val) list_size = len(list) - 1 idx0 = 0 idxn = list_size # Find the middle most value while idxo list[midval] idxo = midval + 1 else: idxn = midval - 1 if idxo > idxn: return None # Initialize the sorted list list = [2,7,19,34,53,72] # Print the search result print(bsearch(list, 72)): print(bsearch(list, 11)): 2. Write the ouput or result of above coding and provide your justification 3. Perform the tracert table of the above coding