3. Rank finding problem: In the 2-dimension space, we shall say that a point A=(a1,a2) dominates a point B=(b1,b2) if and only if a1 > b1 and a2 > b2. For the points in Figure 1, we have the following relation: a. B, C and D dominates A. b. D dominates A, B and C Figure 1: A case of showing the dominance relation Given a set of n points, the rank of a point X is the number of points dominated by X. Design ar algorithm to find the rank of every point.