Hlustrate the chain of recursive calls for the given code fragment, furnishing the result def binsrch(elements, target, low, high): if low > high: return None mid = (low + high) // 2 if elements[mid] target: return binsrch(elements, target, low, mid 1) else: return mid mylist [3, 6, 8, 12, 15, 18, 23, 35, 44, 49, 56, 59, 64, 70] binsrch (mylist, 6, 8, len (mylist) - 1)