Insertion Sort

Which are true of Insertion Sort (traditional implementation, without optimizations)?

Multiple answers:You can select more than one option.

Please, include the explanation with the answer.

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

B) It uses (n^2) comparisons in the average case

C) It uses (n^2) comparisons in the best case

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

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

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