Given two arrays each of length n, arr1, and arr2, in one operation, any two elements of an array can be swapped. This can occur any number of times. Find the maximum possible sum of i*(arr2[1]- arr1[1]) for all 1 sisn after rearranging the arrays. Since the maximum possible sum can be large, return the value modulo (10 + 7).