This assignment consists of two parts: 1. Write a program (in Python, C/C++, C# or Java) for the Sieve of Eratosthenes and look for the biggest prime number that you can find in your computer. Record the time it took for your machine to find that number. 2. Write a program that given a list of the first prime numbers smaller than one hundred, randomly multiply two of them. Then given the product the program has to guess what were the factors or prime numbers used for that product. Count the number of combinations tested before finding the correct pair. Run it at least twenty times or more and write down your results for every case and the average of the combinations tried to find the correct prime numbers