The function below takes a single integer input: number. complete the function to return a boolean indicating whether the number is prime. recall that a number is prime, if it isn't evenly divisible by any integer other than 1. the recommended way to implement this function is to iterate (using a for loop) through all of the numbers greater than one, but less that number. (the range() function is your friend, here.) for each of those numbers, test if they evenly divide number using the % operator. if any of them do divide evenly, then return false. if you get through all of the numbers without any dividing evenly, then it must be prime, so return true.