Adapt the binary search algorithm so that instead of outputting whether a specific value was found, it outputs whether a value within an interval...

Adapt the binary search algorithm so that instead of outputting whether a specific value was found, it outputs whether a value within an interval (specified by you) was found. Write the code and give the time complexity of the algorithm using the Big O notation.Example input: L = [2,3,5,7,9,13] low= 10 high = 14 Output: True