Write a java program that asks a user for a natural number and tells the user if that number is prime or composite. If the number is composite, it will then determine the prime numbers that are closest to the user input, both smaller than and larger than the user input. Use for loops and if statements. No complex boolean expressions, meaning, do not use static boolean isPrime(int n) - use boolean prime = true;