In python 3, solve the problem using recursion and divide-and-conquer approach.

No sorting libraries can be used. No min() max() functions

# # Problem Specifications: # # Input: An array A with positive numbers (unsorted). # # Output: A pair of positions [i, j] with the property that i < j and A[i]  A[j] (i.e. an inversion), # # such that A[i]  A[j] is the maximum possible among all inversions in A. # # Example Input: [1, 25, 2, 6, 11, 16, 8] # # Example Output: [2,3] (25-2 is maximum)