Question: The Binary Search Algorithm we have presented appears to be more efficient than a linear search, O(logn) versus O(n), but the binary search assumes the input list is ordered. Suppose we modify the Binary Search Algorithm so that it accepts an unordered list as input by first using an efficient sorting algorithm and then the binary search as described in this section. Is this new algorithm still more efficient than a linear search? Explain.