c code plz urgent

Write a recursive function that returns 1 if an array of size n is in sorted order from smallest to largest with all values less than or equal to max, and 0 otherwise. Note: If array a stores 3,6,7,7,12, then isSorted (a,12,5) should return 1 but isSorted (a,11,5) should return 0 . If array b stores 3 , 4,9,8, then isSorted(b, 20,4) should return 0 , since 9 is bigger than 8 but appears before it