ATTENTION: faster than n^2

Divide-and-conquer The input for this problem consists of n radar stations where station i is given by its integer coordinates x_i and y_i in the plane. We say that station i can transmit to station j if station j is south-west of station i, i.e., x_i >= x_j and yi >= yj . The load factor of station i is de ned to be the number of stations it can transmit to (not counting itself). The goal is to compute the load factor of each station. Give a divide and conquer algorithm for this problem. You algorithm has to have worst case running time in o(n²) (small o)(i.e. it must be asymptotically faster than quadratic time direct algorithm).