I'm stuck in the question solve this question quickly

Monte Carlo algorithms are extremely simple and powerful: we use repeated random sampling to rapidly determine an excellent approximation to an exact probability. In class, we saw how a simple Monte Carlo algorithm could estimate 17 with extreme precision. For each of (a), (b), (c) below, you will submit a computer program (in the programming language of your choice), where you estimate the correct answer via a Monte Carlo analysis. You will get full marks if you clearly document how and why your program works, and obtain a probability that diers from the correct answer by at most 0.1%. Please label your computer program appropriately (e.g. Mwaura25.py) and submit it along with your solution to part ((1) below (e.g. Mwaura2-5.pdf). Consider an regular polygon with in. equal sides (this is known as an \"ngon\"). Pick any point P, at random, inside this ngon. Let C be the centre of the n-gon, and let Q be the point on the ngon's perimeter that is closest to P (note that this implies that PQ is perpendicular to the side containing Q). (a) Let n = 4. Estimate the probability that PC 0:), determine the exact probability that PC