The PrimeFinder class below contains several static methods which are used to determine information about prime numbers. Prime numbers are positive integers which have exactly two divisors (1 and themselves). public class PrimeFinder
{

/** Returns the number of prime numbers between lower and upper inclusive
* Precondition: 0 < lower <= upper
*/
public static int primesBetween(int lower, int upper)
{
/* to be implemented in part (a) */
}

/** Returns the difference between num and the closest prime number which
* is greater than or equal to num
* Precondition: num is positive
*/
public static int gapToNextPrime(int num)
{
/* to be implemented in part (b) */
}

/** Returns true if the integer n is a prime number
* Precondition: n is positive
*/
private static boolean isPrime(int n)
{
/* implementation not shown */
}

}

Required:
Write the primesBetween method which returns the number of primes between the two parameters inclusive. See below for examples of this method being used.