Are based on the following Pascal code.FOR i:=1 TO n -1 do BEGIN k:=i: FOR j:=i+1 TO n DO IF A[j] THEN k:=j: IF k<>i THEN BEGINX:=A[k]; A[k]:=A[i]; A[i]:=x END END;<---> The sorting method described by the code is called

A． Insertion sort

B． Selection sort

C． Radix sort

D． Merge sort