(71) is true regarding simple sort techniques.
A.Both insertion sort and selection sort require O(n)moves.
B.Exchange sort is frequently referred to as a bubble sort.
C.If random data are in an array that is to be sorted, an insertion sort will give the best performance for large elements with small sort items.
D.Exchange sort is the least expensive.