In the insertion sort there is a while loop use linear search to scan (backward) through the sorted subarray A[1..j-1] Can we use binary search instead to improve the overall worst-case running lime of insertion sort to theta (lgn)