Write a function that takes in $4$ parameters: an int array, its size, the left index, and the right index; and checks if the elements between the left and right index $($inclusive$)$ in the int array are sorted in ascending order. If the left index is larger than the right index, swap them first. Then, if the left index is invalid $($e$.$g$.,$ negative, larger than the size$),$ use the leftmost valid index of the array; if the right index is invalid, use the rightmost valid index of the array. Use this function header:

bool rangedCheckforSorted$($int array$[],$ unsigned int size, int leftIndex, int rightIndex$)$

For example $($suppose there is a myIntArray created as $[-4,3,-12,0,5,72,88,128,1,64])$:

rangedCheckforSorted$($myIntArray$,10,-2,3)$ will check indexes between $0$ and $3,$ and return false

rangedCheckforSorted$($myIntArray$,10,7,2)$ will check indexes between $2$ and $7,$ and return true

rangedCheckforSorted$($myIntArray$,10,5,5)$ will check indexes between $5$ and $5,$ and return true

rangedCheckforSorted$($myIntArray$,10,0,9)$ will check indexes between $0$ and $9,$ and return false

You can assume the array has one or more elements and the size is always correct. Content of the int array does not change after calling this function.

Only include the a$1\_$question$2.$h header file, $,$ and the function definition $($and your helper functions, if any$)$ in the source file and name it as a$1\_$question$2.$c$.$ Do not use recursion in your answer.