java.Write a recursive function named RecMax that finds the maximum value in an array.

The function takes $3$ integer parameters: an array A$,$ the start index and the end

index. It divides the array into halves $($left half and right half$)$ and calls itself

recursively 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 then computes the

maximum value in the entire array. The base case is an array of size $1.$ For

simplicity, assume that the total array size is a power of two $(2,4,8,$ etc.$).$

For example, if the array size is $16,$ the initial call to RecMax will pass the array

name, a start index of $0$ and an end index of $15.$ RecMax will then divide this into

two halves: one with a start index of $0$ 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 will then call itself

recursively on each of these two halves, and so on$.$