This program is in Java!

2. Define a recursive method named findLargest), which locates and returns the largest value in an array of integers. It may be more efficient to use the max() helper method below (compare the current element to the largest element in the rest of the array): public static int max(int a, int b) if (a> b) return a; ) else return b; > Use the following method header for findLargest(): public static int findLargest (int [] list, int currentIndex) Hint: Start at one end of the array, and make the opposite end's index into your base case for example, starting at index Q, the base case occurs when you reach index(length-1)