Write a program which implements a recursive merge sort function. An example can be found in the textbook or on the internet.

Write an is$\_$increasing$()$ function that ensures that each value in an array is non$-$strictly increasing. This means that at a given index n$,$ the value at index n$+1$ is greater than or equal to the value at n$.$ Return true if this property holds, false otherwise. Use this header:

bool is$\_$increasing$($int$*$ values, int size$)$

Create an array of $100$ random integer values. Call the is$\_$increasing$()$ function which should return false.

Call the merge sort function and pass it the array of integers. Call the is$\_$increasing$()$ function again; it should return true.

For example: Assume an array is $[4,8,2,4,1,9].$ Calling is$\_$increasing should return false because the value at index $2$ is less than the value at index $1.$ After sorting the array is $[1,2,4,4,8,9]$ and calling the is$\_$increasing function should return true because each value is not less than its predecessor.

Note: the term non$-$strictly increasing means that two adjacent values may be equal; strictly increasing means that the right$-$most value is greater than the left$-$most value of the two. For random values, it is almost certain that duplicated values will exist.