A prime integer number is one that has exactly two different divisors 1 and the number itself. Design, write, run and test a C++ program that finds and prints all the prime numbers less than 100. (Hint: 1 is a prime number. For each number from 2 to 100, find remainder = number % n, where n ranges from 2 to sqrt(number). If n is greater than the sqrt(number), the number is not equally divisible by n. Why? If any remainder equals 0, the number isn't a prime number.
