Your friend thought the insertion sort presented in class seems rather inefficient in worst case

scenario. He thought he could improve the run time so it runs asymptotically faster if in the while loop

(lines 5-7) instead of using a backward scan through the already sorted items to find where the jth item

belongs, he instead used binary search to find where the jth item belongs. Is he right? Give Reasons