The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?

The worst case time complexity of insertion sort is O(n2). What will b

1.	The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?
A.	O(nlogn)
B.	O(n2)
C.	O(n)
D.	O(logn)
Answer» C.