The minimum distance of an unsorted array array is mini,j,i6=j |A[i] A[j]|. Namely, if we sort the array this value is the minimum absolute values of the difference between two contiguous elements. Consider an n n matrix A. Say that we want to choose one element from every row, A[1, i], A[2, j], A[3, k], . . . A[n, p]. The problem is to find an array with minimum distance under this constraint. Namely, we want to find a minimum distance array under the constraint that the first item belongs to the first row, the second item belongs to the second row, and so on. Give an algorithm for the problem

PSEUDO CODE ONLY