In this week$$s assignment, you will write a program that prints the prime numbers in a given range.

A prime number is a natural number $($positive integer$)$ that is only divisible by itself and $1.$ There

are various ways to check whether a number is a prime number, with various levels of efficiency, and

to pass all test cases you need to implement an efficient prime checker. Note: you do not need to

implement the Sieve of Eratosthenes; efficiently eliminating a large section of the search space is

enough.