... insertInPlace 2 211 11( 1) {1 2 1} ( 1) 2 44 2 njj n nn n=−= +++−= −≈∑CHAPTER 1 ■ SORTING, SEARCHING, AND MERGING 12 Using insertInPlace, we can rewrite insertionSort (calling it insertionSort2) ... insertionSort2) as follows: 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 + ... 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[]);...