B) You decided to improve insertion sort by using binary search to find the position p where

the new insertion should take place.

B.1) What is the worst-case complexity of your improved insertion sort if you take account

of only the comparisons made by the binary search? Justify.

B.2) What is the worst-case complexity of your improved insertion sort if only

swaps/inversions of the data values are taken into account? Justify.