Consider the following recursive implementation of a Binary Search. a. Determine the complexity of the function on some array of length n b. Add print statements to the code below, with useful comments and information, that could be useful in debugging. def binary_search (arr, low, high, x): if high >= low: else: mid if arr [mid] (high + low) // 2 else: result mid elif arr [mid] > x: == X: result = binary_search (arr, low, mid - 1, x) result = binary_search (arr, mid + 1, high, x) result = -1 return result