QUESTION

Text
Image

# Please I need Answers in JAVA ONLY!!! Given an array of distinct integers, determine the minimum absolute difference between any two elements. Print all element pairs with that difference in ascending order. Example numbers $=[6,2,4,10]$ The minimum absolute difference is 2 and the pairs with that difference are $(2,4)$ and $(4,6)$. When printing element pairs $(i, j)$, they should be ordered ascending first by $i$ and then by $j$. 24 46 Function Description Complete the function closestNumbers in the editor below. closestNumbers has the following parameter(s): int numbers $[n]$ : an array of integers Returns NONE Prints distinct element pairs that share the minimum absolute difference, displayed in ascending order with each pair separated by one space on a single line Constraints - $2 \leq n \leq 10^{5}$ - $-10^{9} \leq n u m b e r s[i] \leq 10^{9}$ Input Format for Custom Testing Sample Case 0 Sample Input 0 STDIN $\begin{array}{l} 4 \rightarrow \text { numbers[] size } n=4 \\ \rightarrow \text { numbers }=[4,2,1,3] \\ \end{array}$ Sample Output 0 12 23 34Language Java 8 Autocomplete Ready (i) $1>$ import java.io. *; ... 12 13 14 $15 \vee$ class Result \{ 16 $17 \vee /$ * 18 * Complete the 'closestNumbers' function below. 19 20 21 * The function accepts INTEGER_ARRAY numbers as parameter. $\star /$ public static void closestNumbers(List<Integer> numbers) \{ // Write your code here \} \} $>$ public class Solution $\{\cdots$ 52  