大小为k的数组(大小为n)的子集的数量，最大元素与最小元素在最大x上的差异

I came across this question during a test. Given an array of size n find number of subsets of size k having difference between maximum and minimum element at most x.I came across this question during a test. Give