Create a function that returns true if the first array can be nested inside the second. arr1 can be nested inside arr2 if: 1. arr1's min is greater than arr2 's min. 2. arr1's max is less than arr2's max.

use c code to develop the condition and function for the following items and then redevelop the code by adding the function as shown below, the original code has been given below. Hint: a)the function need to be made and develop  and than add to the code 1. print Reverse 2. void reverseIt 3. void search Array 4.void search array 5. void array copy and void arrayDiff) b) the answer must be include and output and c code void printReverse(int array[], size); //prints the array reverselyvoid reverseIt(int array[], size); //reverses an arrayvoid searchArray(int array[], int size, int num);// returns the first index of the array whose value is num.//returns -1 if the number was not found in the array// optional for lab 6:void searchnArray(int array[], int size, int num, int n);// returns the nth index of the array whose value is num.//returns -1 if the number was not found in the arrayvoid arrayCopy (int arDest[], int arSource[], int commonSize);// copies cells from arSourc to arDestvoid…

Create a function using Java: Number of Rows = 3-6 Number of Columns = 3-6   Function Name: winInDiagonalFSParameters: board: 2D integer array, piece: integerReturn: booleanAssume board is valid 2D int array, piece is X==1/O==2.Look at all forward slash / diagonals in the board. If any forward slash / diagonals has at least 3consecutive entries with given type of piece (X/O) (3 in a row XXX, OOO), then return true,otherwise false

C language