How many swaps will be required in the worst case to sort an array having n elements using binary insertion sort?

How many swaps will be required in the worst case to sort an array hav

1.	How many swaps will be required in the worst case to sort an array having n elements using binary insertion sort?
A.	n
B.	1
C.	n * log n
D.	log n
Answer» E.