Acompete Hendyo 1. Counting Pairs 1 > include int main() numbers - [1, 1, 1, 21 k1 This array has two different valid pairs: (1, 1) and (1, 2) Fork 1. there is only valid pair which satisfies a - * = be the pair (a, b (1.21 Function Description Complete the function countPairs in the editor below countPairs has the following parameters): int numbersin: array of integers int k target difference Returns int number of valida. b) pairs in the numbers array that have a difference of 1 Constraints 2 ns2x10 Os numbers 10" where sin Oks 10% Input Format for Custom Testing Sample Case o 9 Input Format for Custom Testing Input from stdin will be processed as follows and passed to the function. 10 11 12 13 14 15 The first line contains an integer n, the size of the array numbers. Each of the next n lines contains an integer numbers where Osi<.>