1 II Task: Implement the 'sortIntegers function below 2 Libraries5445445 4 #include stdio.h> // Include file for standart input/output 6 I1Helper Functions 7 8 // Merges two subarrays of arr. 9 // First subarray is arrll..m 10 I/ Second subarray is arr[m+1..rl 11 void merge(int arr[, int 1, int m, int r) 12 IITODO: implement merge. 13 14 15 // Provided below is a sort function. We have also 16 // provided a template for how to document functions 17 // to help organize your code. 18 I/ Name: sortIntegers 19 // Input (s): (1) 'array' is a pointer to an integer address. 21 11 This is the start of some contiguous block of memory' that we will s (2) 'size' tells us how big the array of data is we are sorting. 23 / Output: No value is returned, but 'array' should be modified to store a sorted ar 24 void sortIntegers (int* array, unsigned int size)f 25 26 27 28 9 I Input: A pointer to an array (i.e. the array itself points to the first index) TODO: Implement merge sort The size of the array (Because we do not know how big the array is automati 31 void printIntArray (int* array, unsigned int size)