First, solve the problem at https://codingbat.com/prob/p202587 and then come to this one. A number is called "nearly-prime" if besides, 1 and itself, it's divisible by exactly one other integer. Define a function that when passed an integer, returns true if it is nearly-prime, false otherwise.