Using Python

Create a Multiprocessing, Threaded, and Asynchronous application that will calculate the highest prime number in $3$ min.

You must start a $0$

After you have created these programs analyze the performance of each.

IE: How long did it take to find the prime number?

Compare each prime and why each found that prime number.

Add any additional details you would like.

Focus on writing the code and optimizing your Threaded and Asynchronous code.

Your analysis should be short and no longer than $1$ page For threaded code you can use thisLinks to an external site.

$($random$)$ resource to understand how to share resources

If you wish you can calculate any other nondependent item and then perform analyses.

For code consistency use the following is$\_$prime function.

def is$\_$prime$($n$)$:

if n $<=1$:

return False

for i in range$(2,$ int$($n $**0\mathrm{.}5)+1)$:

if n $\%$ i $==0$:

return False

return True