Please answer it on C Programming only

4.24 An interesting way of calculating is to use a technique known as Monte Carlo, which involves randomization. This technique works as follows: Suppose you have a circle inscribed within a square, as shown in Figure 4.25. (Assume that the radius of this circle is 1.) . First, generate a series of random points as simple (x, y) coordinates. These points number of random points that are generated, some will occur within the circle must fall within the Cartesian coordinates that bound the square. Of the total Next, estimate by performing the following calculation: T-S(number of points in circle) (total number of points)-4 x (number of points in circle)/(total number of points) Write a multithreaded version of this algorithm that creates a separate thread to generate a number of random points. The thread will count the number of points that occur within the circle and store that result in a global variable. When this thread has exited, the parent thread will calculate and output the estimated value of t. It is worth experimenting with the number of random points generated. As a general rule, the greater the number of points, the closer the approximation to . Figure 4.25 Monte Carlo technique for calculating