C program only (Not C# or C++)

Please include many comments explaining the methodology so that I may better understand

Bounding Volumes You are in charge of managing zones for the country of Bitland. The good news is that the zones begin and end at positive integral coordinates on a Cartesian plane measured in km. additionally all the zones are axis aligned and rectangular. The bad news is that Bitland allows for zones to overlap, and some square km might not have zones at all. Below an example of a possible zoning. (6, 4) ZONE 1- ZONE 2ZONE 3 (0, 0) Bitland is still expanding and you will need to determine when making a new zone how many unique zones are in the location you are placing the new zone. Problem Write a program that when given a list of zones on a 2D coordinate plane determines for each zone how many previous zones overlap the new zone. Input Specification The first line of input will be a non-negative integer n (n100,000), representing the number of zones to place. The input will have n remaining lines, the i-th of which will contain 4 positive integers xu, yu, x, and yz representing the coordinates of the lower left, and the upper right corner, respectively, of the i-th zone. You are guaranteed that the product of the maximumx coordinate and the maximum y coordinates is less than 1,000,000. Additionally the sum of the zone areas will be less than or equal to 1,000,000. Lastly no square km will be contained by more than 20 zones. Output Specification For each zone output a single integer on a line by itself representing the number of unique other zones overlapping with the added zone