Let S be a set of n 2-dimensional points. Given a point p =x, y, rank(p) is the size of the following set:

Note that it is possible to have two points p and q with rank(p) = rank(q). Write a divide and conquer algorithm for computing the ranks of all points in S. State the recurrence relation capturing the runtime of the algorithm and solve the recurrence relation.