Please perform a time complexity analysis for the following recursive function. Python. I will upvote. Thanks

int minNumber = minRecursive (pool, 0, (pool.length - 1)); | public static int minRecursive(int[] array, int start, int end) { if (end == start) { return array[start]; } int middle - start + (end - start) / 2; return Math.min(minRecursive (array, start, middle), minRecursive (array, middle + 1, end)); } }