Suppose you are given a list of n unique integers S = [a1, a2, . . . , an]. You must answer n queries of the form How many unordered pairs of distinct a, b S satisfy |a b| k? where k is an integer.

Design an O(n^2 ) algorithm that answers all of these queries and describe it in pseudo code