// =============================================== // =============================================== Requirements //

[answerhappygod]

// ===============================================


// ===============================================
Requirements
// Implement the insertion sort based on the provided
template.
// The output should be:
//
// Before: []
// After: []
// Before: [1]
// After: [1]
// Before: [1, 2]
// After: [1, 2]
// Before: [2, 1]
// After: [1, 2]
// Before: [3, 5, 2, 4, 1, 9, 10, 12, 11, 8, 7, 6]
// After: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
//
// =============================================== Note
//
// 1. DO NOT DELETE ANY COMMENT!!!
// 2. Modify the file name to "InsertionSort.java" before
compiling it.
//
// ===============================================
import java.util.ArrayList;
public class InsertionSort {
// Insertion-sort of a positional list of integers into
nondecreasing order

public static void insertionSort(ArrayList<Integer>
list) {
// COMPELTE THIS BLOCK


}
public static void main(String[] args) {
int[][] tests = {
{},
{1},
{1, 2},
{2, 1},
{3, 5, 2, 4, 1, 9, 10, 12, 11, 8, 7, 6},
};
for (int[] test : tests) {
ArrayList<Integer> input = new
ArrayList<Integer>();
for (int element : test) {
input.add(element);
}
System.out.println("Before: " + input);
insertionSort(input);
System.out.println("After: " +
input);
System.out.println();
}
}
}
Please assist with this COMPLETE THIS BLOCK part and run the
code please also attach the ss to the running code.