Instead of actually computing the number of primes between 2 and N, we can get an estima...

Instead of actually computing the number of primes between 2 and N, we can get an estimate by using the Prime Number Theorem, which states that

where prime(N) is the number of primes between 2 and N (inclusive). The function ln is the natural logarithm. Extend the program for Exercise 9 by printing the estimate along with the actual number. You should notice the pattern that the estimate approaches the actual number as the value of N gets larger.