2. Given an array of size n, write Input : 202045898990 sorted in ascending order or rot output: res Equal values are allowed in an Input : 202078989997 equal values are considered sorted. The basic idea for the recursive approach: - If size of array is zero or one, return true. - Check last two elements of array, if they are sorted, perform a recursive call with n1 else, return false. - If all the elements will be found sorted, n will eventually fall to one, satisfying Step 1