Arrays Basic C language

code that were are given:

To get more practice working with arrays, you will write several functions that involve operations on arrays. In particular, implement the following functions in the file array utils.c and array_utils.h on Zybooks Write a function that, given an integer array and an integer x determines if the array contains x anywhere within the array. It should return true if it does, false otherwise int contains (const int *arr, int size, int x) Write a function that given an integer array and an integer x determines if the array contains x within two provided indices, ij.It should return true if it does, false otherwise. int containsWithin (const int *arr, int size, int x, int i, int j); Write a function that, given an array of integers and its size, reverses the elements in the array. For example,if the original array was [10,15, 5,25, 0] the new array should be [0, 25, 5,15,10 void reverse (int *arr, int size) Order Statistic You'll get more practice with arrays by writing your own version of the Order Statistic program which we have seen in past works. Write a function that takes in an array arr and integer i (that is less than or equal to the number of elements-something to verify in error checking!), and returns the i-th smallest element of the array. This function should be implemented without the help of any C-Library sorting functions int orderstatistic(int *arr, int size, int i) #include 3 #include "array-utils.h" 4 5 int containsWithin const int *arr, int size, int x, int i, int j) f 6 //todo 7 return 0; 8 9 10 int contains (const int *arr, int size, int x) \ 12 13 return e; 14 15 16 void reverse(int *arr, int size) f 17 18 return; //todo //todo 20 21 int orderStatistic(int *arr, int size, int i)t int element-1; //todo 24 25 26 27 28 int main) 29 30 31 32 return element; //you may choose to do your testing here return