Write a recursive method called maxValue that takes an array of ints and two indexes as arguments and returns the maximum value found between those two indexes. Identify your base case and your general case. You may assume that the input array will never be allowed to be null. Use the following method signature:

public static int maxValue(int[] arr, int start, int end) 

HINT: How can you make this problem smaller? If you had a function that gave you the maximum value of the items from start+1 to the end, how could you use that to find the maximum value of the entire array?