(15 pts) Let X be an array of integers that stores the x-coordinates of n points on the x-axis of a Cartesian plane, where X[i] stores the x-coordinate of i-th point. We want to find the minimal distance between any pair of points among the given n points, i.e., the minimal [X[i] - X[j]| among all 0