Divide-and-conquer; programming question. Write a Java program. The input for this problem consists of n radar stations where station i is given by its integer coordinates x, and y in the plane. We say that station can transmit to station j if station j is south-west of station i i.e., xand yy The load factor of station j 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 program will read multiple lines from the standard input and print the results to the standard output. Input Speciation The input consists of n +1 ines. The first line has n the number of stations. The following n lines have three numbers each: the ID number of station L and its x and yi coordinates. All station IDs are different. We will not be testing whether your program detects input errors Output Specification The output must have n lines, each giving a station ID number and the load factor for that station. Your output must be sorted by station ID (in increasing order). Sample input 4 233 10 42 13 5 6 7 21 Sample output 2 1 7 0 10 1 13 3 Submit single Java file named radar.jav