... void insertionSort2(int list[], int lo, int hi) { //sort list[lo] to list[hi] in ascending order void insertInPlace(int, int [], int, int); for (int h = lo + 1; h <= hi; h++) insertInPlace(list[h], ... n, in C. When run, the program prints the contents of C, like this: 16 21 25 28 35 40 47 54 61 75Program P1.6#include <stdio.h>int main () { int merge(int[], int, int[], int, int[]); ... //end main int merge(int A[], int m, int B[], int n, int C[]) { int i = 0; //i points to the first (smallest) number in A int j = 0; //j points to the first (smallest) number in B int k =...