INSERTION-SORT(A):

1 For j = 2 to A.length

2 Key = A[ j ]

3 //inser A[ j ] into the sorted sequence A[1...j-1]

4 i=j-1

5 while i > 0 and A[ i ]>key6

6 A[i+1] =A[ i ]

7 i=i-1

8 A[i+1]=key

Observe that while loop of line 5-7 of the insertion-sort uses linear search to scan through the sorted subarray A[i...j-1].Can we use a binary search instead to improve the overall worst case running time of insertion sort to (n ln n)? (Justify your answer)