In this problem, we will write a program to use a Monte Carlo simulation to approximate the area of the region of overlap of disks in the plane. Your program should take two command line arguments: the name of a file, and a long long int N representing the number of trials to conduct. The file will consist of an unknown number of lines, each with three doubles, separated by commas. The first two doubles on each line will represent the x and y coordinates respectively of a disk, and the third will represent its radius. The region of overlap is the set of points lying inside every one of the disks specified by the file. A Monte Carlo procedure to determine this area can be described very briefly as follows: (a) For N total trials, draw a point uniformly at random from a fixed large region S that contains all of the disks. (b) Determine the count of all trials for which the point randomly selected happened to lie within every one of the disks. (c) Calculate the probability that the randomly selected point happened to lie within every disk. (d) The area of the intersection of the disks will be approximately this probability multipled by the area of the region S. Report the result to the user using six decimal places of fixed precision. Some sample input files with approximate corresponding outputs are posted on Sakai. Note that your values are likely to vary from these due to the randomness involved.