Single File Programming Question A trekking group wants to make camp inside a large forest with thousands of trees, all very tall, slick, and upright, with leaves and branches much above man-heig They will pitch a single tent, with the canvas of the tent being conical in shape, and the tent having three long ropes fitted with the canvas base that need to be tiec with the bases of three trees so that the tree-bases form an acute-angled triangle (T). The circumcircle (C) of the points in T form the camp-base within which the nomads will set up all their other activities, so they naturally want to make their camp-base as large as possible and free of any other trees, although there may be some trees standing on the circumference of C. However, the nomads are all deadly against cutting down any tree. Imagine that you are the nomad leader and ha the map of the forest. On this map, you find that the forest belongs to a planar land surface, and you also get the coordinates of all the tree bases. How can you compute the area of the largest camp-base that can be made? (Use pi=3.14 exactly) Input format: The first line of input contains the number of trees X followed by X lines, each containing the x and y coordinates (in that order) of one tree (both positive integers). Output format: Output the single integer indicating the area of the largest camp base. The integer should be the floor of the area computed (for example, if the area computed is 12 output 123). Code constraints: 0