10 points Status: Not Submitted Ja Write a recursive function that finds the minimum value in an array. Your function signature should be ay public int findMinimum(int[] numbers, int length) One way to think of finding a minimum recursively is to think the minimum number is either the last element in the array, or the minimum value in the rest of the array". For example, if you have the array [1, 3, 2, 567, 23, 45, 9]. the minimum value in this array is either 9 or the minimum value in [1, 3, 2, 567, 23, 45] Hint: The trick is you don't actually have to resize the array. Just tell the function the array is shorter than it really is! 0 8 .6.6: Recursive Minimum 1 public int findMinimum(int[] numbers, int length) 2- // Base Case: What is the smallest array you can have? What is the minimum value of that array? // Recursive call: How do you find the minimum of the rest of the array? (Not including the last element) // Return: The minimum of (the last element, minimum of the rest of the array)