The sorting method described by the following code is called( ).FOR i:=1 TO n—1 doBEGIN k: =i;FOR j: =i+1 TO n DO IF A[j]＜A[K]THEN k:=j; IF k＜＞i THEN BEGINx:=A[k];A[k]: = A[i];A[i]:=xEND END;

A．insertion sort

B．selection sort

C．radix sort

D．merge sort