Insertion Sort Stability

Based on the provided insertionSort method, which statement best explains why this algorithm is considered stable?

public class StableSortExample {
    public static void insertionSort(int[] arr) {
         for (int i = 1; i < arr.length; i++) {
             int key = arr[i];
             int j = i - 1;
             while(j >= 0 && arr[j] > key) {
                 arr[j+1] = arr[j];
                 j--;
             }
             arr[j+1] = key;
         }
    }
}