PrimeNumbers

Question

1. (PrimeNumbers) An integer is said to be prime if it is divisible by only 1 and itself. For example, 2, 3, 5 and 7 are prime, but 4, 6, 8 and 9 are not.

1-     Write a function that determines whether a number is prime, if the number is prime return true otherwise return false.

                  2- Use this function in a program that determines and prints all the prime numbers between 2 and                         10,000