Please use java and provide a better solution than O$($n$^2),$ will only accept better solution, thank you a lot!! Two processes are considered to be computationally the same if their resource requirements differ by at most $k.$

Given the array process and an integer $k,$ find the number of pairs of processes that are computationally the same.

Function Description

Complete the function getPairscount in the editor.

getPairscount takes the following arguments:

int process$[$n$]$: the computational resource requirement of the processes

int $k$ : the threshold for being computationally the same

Returns

long integer: the number of pairs of processes that are computationally the same

Example $1$:

Input: process $=[100,200,300,400],k=250$

Output: $5$

Explanation:

The computationally$-$same processes are $(100,200),(100,300),(200,300),(200,400),$ and $(300,400).$

Example $2$:

Input: process $=[10,12,11],k=0$

Output: $0$

Explanation:

All the pairs of processes have differences between computational resource requirements greater than $0.$

Example $3$:

The process pairs are:

Input: process$=[7,10,13,11],k=3$

Output: $4$

Explanation:

The process pairs are shown in the above image. Hence the answer is $4.$

Constraints:

$1n2**{10}^{{?}^{{?}^{?}}}5$

$1$ process $[i]{10}^{{?}^{{?}^{?}}}6$

$0k{10}^{{?}^{{?}^{?}}}6$