This code should be completed in C.

(10 pts) Implement the merge sort algorithm: https://www.tutorialspoint.com/data_structures algorithms/merge_sort_algorithm.htm. The implementation should sort in ascending order and must be composed of two functions: MergeSort (a) Name: MergeSort (b) Return type: Nothing (c) Argument1 Input/Output: Pointer to the first element in the array of integers (d) Argument 2 - Input/Output: Pointer to the last element in the array of integers Merge (a) Name: Merge (b) Return type: Nothing (c) Argument1 Input/Output: Pointer to the first element of the array of integers. (d) Argument 2 - Input/Output: Pointer to the middle element of the array of integers (e) Argument 3 Input/Output: Pointer to the last element in the array of integers. Notes: (a) The middle pointer indicates the first element of an ordered sub-array (b) Allocate temporary buffers in the heap