Answer Happy

b) Analyse and find what will happen to the list in arr when the function definition in Figure Q2 is invoked. Illustrate the process involved step-by-step. Use the sorted data in your answer for Question 2a as input for arr, and x is the last integer from the sorted data. def binary_search(arr, low, high, x): # Check base case if high > low: mid= (high + low) // 2 # If element is present at the middle itself if arr[mid] == x: return mid # If element is smaller than mid, then it can only # be present in left subarray elif arr[mid] > x: return binary_search(arr, low, mid 1, x) # Else the element can only be present in right subarray else: return binary_search(arr, mid + 1, high, x) else: # Element is not present in the array return -1 Figure Q2