Which are true of Insertion Sort, using Binary Search instead of Linear Search to find the points of insertion? ( You may select multiple anwsers)

a

It uses (n^2) comparisons in the worst case

b

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

c

It uses (n) comparisons in the best case

d

It uses (n^2) movements of elements in the worst case

e

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

f

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