Zy book $4\mathrm{.}11\mathrm{.}3$: $($Problem $4\mathrm{.}24$ in the $10$th edition$).$ An interesting way of calculating $\backslash$pi is to use a technique known as Monte Carlo. Write a multithreaded $($at least $2$ threads$)$ 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 $\backslash$pi $.$

Suppose you have a circle inscribed within a square, as shown in figure below. $($Assume that the radius of this circle is $1.)$

First, generate a series of random points as simple $($x$,$ y$)$ coordinates. These points must fall within the Cartesian coordinates that bound the square. Of the total number of random points that are generated, some will occur within the circle.

Next, estimate $\backslash$pi by performing the following calculation:

$\backslash$pi $=4*($number of points in the circle$)/($total number of points$)$