Please answer this question in Java, and use comments to explain. Thank you!

4. (5 points) Implement the algorithm that solves the Max-Min problem from Friday using Divideand-Conquer. In other words, given an integer array of length n, implement a method that returns the maximum and minimum values in that array by keep dividing the array into 2 parts. Assume that n=2k for some integer k.s