FOLLOW THE WUESTION INSTRUCTIONS

provide a screenshot and dont use string.h library

and calls itself recursively ( : ) (array into two halves (left half and right half Question 3 [20 points] Write a recursive C function named RecMax that finds the maximum value in an array. The function takes 3 parameters: an integer array, the start index and the end index. It divides the to compute the maximum value in each half. Using the maximum value in the left half and the maximum value in the right half, the function computes the maximum value in the entire array. The base case is an array with size 1. For simplicity, assume that the total array size is a power of two (2 or 4 or 8, etc). For example, if the array size is 16, the initial call to RecMax will pass the array name, a start index of O and an end index of 15. RecMax will then divide this into two halves: one with a start index of O and an end index of 7 (left half) and another with a start index of 8 and an end index of 15 (right half). It then calls itself recursively on each half until a base size of 1 is reached. 3