A prime number is a number that is only evenly divisible by itself and 1. For example, the number 5 is prime because it can only be evenly divided by 1 and 5. The number 6, however, is not prime because it can be divided evenly by 1, 2, 3, and 6. Write a method named isPrime, which takes an integer as an argument and returns true if the argument is a prime number, or false otherwise. Demonstrate the method in a complete program. Use the isPrime method in a program that stores a list of all the prime numbers from 1 through 100 in a file. Hint: Loop through numbers from 1 to 100, for each number call the isPrime() method. If the number is a prime number, write it into the file.