JAVA HELP Please.

/** * primesInRange determines how many prime numbers occur with a range of values * * A prime number is a number divisible only by itself and 1 * * * Here are some examples ("<--" indicates the returned value * * 4 <-- primesInRange(10,20); // 11, 13, 17, 19 * 1 <-- primesInRange(20,28); // 23 * 0 <-- primesInRange(122,130); // no primes in this range * 1 <-- primesInRange(23,23); * * Precondition: 0 < low <= high * * The code below is a stub version, you should replace the line of code * labeled TODO with code that achieves the above specification * * Suggestion: write a helper function isPrime to determine if a number is prime */ public static int primesInRange( int low, int high) { return -1; //TODO 4: fix this } /*

Thank you!