The second problem is built on the foundation of the first problem. It was established that

the sum of the logarithms of prime numbers between $2$ and n will converge on the value of n$.$

For example, the sum of the logarithms of all prime numbers between $2$ and $5000$ is

approximately $4912.$ The sum of the logarithms of all prime numbers between $2$ and $50,000$ is

approximately $49,732.$ The problem is that some may contest that this is a valid theory. To solve

this problem, write a program that evaluates the numbers between $2$ and n to determine if the

number is a prime number. If it is$,$ find the logarithm of the prime number. Add all logarithms of

the prime numbers between $2$ and n$.$ After iterating over the values between $2$ and n$,$ print out

the sum, the number n$,$ and the ratio of these two quantities. The ratio of the sum and n should

converge on the number one. Evaluate the results with multiple values for n to demonstrate this

convergence. To use the Python function log$(),$ add from math import $*$ to the script file

immediately following the block comments that include the assignment name, assignment

purpose, date, and your name at the top of the script file.