Write the program in Java and make sure to use methods

13)- isPrime Method A prime number is a number that is evenly divisible only by itself and 1. For example, the number 5 is prime because it can be evenly divisible only 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 is a complete program HINT: Recall that the % operator divides one number by another, and returns the remainder of the division. In an expression such as num1 % num2, the % operator will return o if num1 is evenly divisible by num2. 14)- Prime Number List Use the isPrime method that you wrote in Programming Challenge 13 in a program that stores a list of all the prime numbers from 1 through 100 in a file