PLEASE ANSWER ASAP IN JAVA

HEADER IS:

public static int countPairs(List numbers, int k) {

hackerrank.com/test/3thbd2f860/questions/20605maj 2h 17m left Language la 1. Counting Pairs ALL Given an integer kand a list of integers, count the number of distinct valid pairs of integers (a, b)in the list for which a.k=b. Two pairs of integers (a, b) and (c,d) are considered distinct if at least one element of (a, b) does not also belong to (cd). 1 > impor 14 15 class 16 17 18 19 20 21 22 23 o Example n = 4 numbers = [1, 1, 1, 2] k = 1 24 - 25 26 2 pu 27 This array has two different valid pairs: (1.1) and (1, 2). For k = 1, there is only 1 valid pair which satisfies a+k=b: the pair (a, b) = (1,2). 3 Function Description Complete the function countPairs in the editor below. 28 29 30 } 31 32 1 33 34 public 35 put 36 37 count Pairs has the following parameter(s): int numbersin): array of integers int ki target difference Returns int number of valid (a, b) pairs in the numbers array that have a difference of k 38 39 40 41 42 42 Constraints 2 sns2 10% . 0 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 } 33 1 The first line contains an integer n, the size of the array numbers. Each of the next n lines contains an integer numbers[i] where 0 si numbers [] size n = 6 numbers[] = [1, 1, 2, 2, 3, 35 36 37 6 1 3] 1 2 2 3 3 1 38 39 40 41 42 k = 1 42 Sample Output o Test Re 2 Type here to search ORI<.>