please sir in gava with out comments , and please write code in netbeans, and give me output please

thanke you so much

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 divided 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 in a complete program TIP: Recall that the operator divides one number by another, and returns the remain- der of the division. In an expression such as numl num2, the operator will return o if numl is evenly divisible by num2