2. 10 marks Divide-and-conquer The input for this problem consists of n radar stations where station i is given by its integer coordinates r, and y in the plane. We say that station i can transmit to station j if station j is south-west of station i, .e., and y, 2 yj The load factor of station i is defined 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(n2) (ie. it must be asymptotically faster than quadratic time direct algorithm)