2. What does the following divide and conquer Python program do? def solve(a, low, high): if low == high: return 0 else: mid = (low + high) // 2 #floor division x = min(a[low:mid+1]) #min element in the subarray a[low], a[low+1],...,a[mid] y = max(a[mid+1:high+1]) #max element in the subarray a[mid+1], a [mid+2],...,a [high] return max(y - x, solve(a, low, mid), solve(a, mid + 1, high))