Method 1:

Method 2:

For writing the PYTHON code to verify GOLDBACH Conjecture, there are 2 methods to check if a number is prime.

While the rest of the code is kept the same, the method 1 is slightly optimized than method 2. The optimized version (method 1) runs about three times faster than the method 2.

Explain clearly the reason for the speed up is...

4 5 5 7 9 main.py Run 1 - def isPrime(n): 2- if(n