Please help with this question answer A-D

3) [46 pointsl Cartography (the drawing of maps) is becoming increasingly digital. Digital cartography is especially advantageous by letting users select the size and color of "event radii" (circles showing the area effected by some event). This ability, in turn, is enabled by data structures which not only order data, but can enable efficient searching-binary search trees. On this question, you will answering questions about using binary search trees to MapLoc instances, where MapLoc is a class used to represent a single location on a map. is: public class MapLoc private double x Location on the map's horizontal axis private doubly y; Location on the map's vertical axis public MapLoc (double nx, double nY) nx y nY: public double distance (MapLoc source) 2)) return sqrt (Math pow (x source. x 2) Math pov (y source. y Math A) 10 points] Because MapLoc instances are NOT comparable, our binary search tree will need to use a comparator. Dist comp will compare two MapLocs using their distance from origin (the location where an event occurred). Complete the Distcomp class so that it performs this comparison. public class Dist comp in plements comparator private MapLoc origin eli public Dist Comp (MapLoc el) origin