Need in C #2, 4, and 5..... functions should not have pointer implementations

120 pointsl Implement a function called fillArray that fills a one-dimensional array with random integers. Integers are picked in the range LOW to HIGH (inclusive.) 1. Here is a demo of filling an array of 40 elements with integers in the range 0 and 100. 0 561981 59 48 35 90 83 75 17 86 715 3019 36 14 16 99 45 12 00 38 53 57 60 61 16 66 45 35 5 61 79 81 52 30 2. Implement a function called findthRange that loca es the largest element in a range of the 120 points! same array. The range consists of the array cells indexed between indices LOW and HIGH, inclusive. Here is a demo where LOW 10 and HIGH 19. 0 5619 81 59 48 35 90 83 75 17 86 7153019 36 14 16 99 45 12 00 38 53 57 60 61 16 66 4535 5 61 7981 52 30 Max = 86 3. [20 pointsl Implement function called reverseArray that reverses the order of the array elements. Here is a sample run: Original: 17 86 71 51 30 99 45 12 16 66 45 35 0 56 19 81 59 4835 90 83 75 9 36 14 16 0 38 53 57 60 61 5 61 79 81 52 30 Reversed: 30 52 81 79 61 61 60 57 53 38 16 14 36 75 83 90 35 48 59 81 19 56 0 5 35 45 66 16 0 12 45 99 1 30 51 71 86 17 4. [20 pointsl LOW and HIGH. Decide what your function should do for indexes out of bounds, or if HIGH