for (j =2 to array.length)
key = array[j];
i =j-1;
while(i > 0 && array[i] > key)
array[i+1] = array[i];
i = i-1;
array[i+1]= key;
above is the standard algorithm of insertion sort, from this we can easily infer that (j>0) && (arr[j−1]>value) is the right option.
Hence, B is right answer.