Write a recurrence representing the runtime of this private function. The public method is provided for context. Usually it's more clear what the parameters for the recurrence are, but this method has many parameters, and the main input data doesn't decrease in size on each recursive call. If you take a look at the base case and recursive call inputs, you'll see that binary search recursively narrows down the remaining region to search in rather than decreasing the size of the input. You might find it difficult to write the recurrence in terms of low and high directly. Instead, you should write the recurrence in terms of a single parameter: the size of the remaining region to search through-call this m. Then, ask yourself how m decreases with each call, and pass that forward in your recurrence Here's some (modified) code for binary search -a standard example for code that runs in log(n) time worst case! Implementing binary search (recursively and/or iteratively) is a common interview question! 7 public static void funBinarySearch(intI] data, int target) funBinarySearch data, 0, data. length 1, target); 10 12 The first call to this private helper method should search through the entire 13 array, since 0 to data. length 1 is the full range of remaining values to 14 search through. The recursive calls will decrease the size of the range being 15 searched by changing 'low' and high' 16/ 17 private static void funBinarySearch(int] data, int low, int high, int target) 18 if (low > high) { System. out. printin"Done." else ( 20 21 int midlow high) 2; if (data[mid] target) 23 24 25 26 27 system. out, println("Found index " mid +"!"); 1t at + if (data[mid]target) ( funBinarySearch data, mid + 1, high, target); else // data[mid]target funBinarySearch (data, low, mid 1, target); 29 30 31