Please read the instructions carefully! Copying/plagiarism on this question will result in you failing the entire 100-point assignment.

We know that a prime number is any whole number greater than 1 that cannot be exactly divided by any whole number other than itself and 1.

Suppose you are given a range of numbers (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20).

How can the primes in the above range of numbers be determined algorithmically?

We don't have to reinvent the wheel here. Several solutions to this problem exist.

Your task is to research this "prime number problem," compare at-least two popular algorithms associated with it and write a SEPARATE 1-page summary on the process. You must include the following four steps in your solution.

a. Define the problem.

b. Analyze the problem.

c. Identify possible solutions (2)

d. Choose the optimal or best solution (1) (i. Explain how the chosen algorithm works to find prime numbers in a range.)

*This question is programming language agnostic. You are not going searching for computer code to solve this problem. You are researching algorithms. A page full of Python, Java, C++ or any other programming language will result in 0 credit for this assignment.