Insertion Sort with Binary Search

Which are true of Insertion Sort, using Binary Search instead of Linear Search to find the points of insertion?

Multiple answers:You can select more than one option.

Please, include the explanation with the answer.

A) It uses (n log n) comparisons in the worst case

B) It uses (n log n) comparisons in the average case

C) It uses (n log n) comparisons in the best case

D) It uses (n log n) movements of elements in the worst case

E) It uses (n log n) movements of elements in the average case

F) It uses (n log n) movements of elements in the best case