give a recursive algorithm that takes as input an integer n which is greater than 1. the algorithm should return the product of all the primes in the range 2 through n. for example, on input 7, the algorithm will return 210, which the product of 2, 3, 5, and 7. the function isprime(x) takes a positive integer x and returns a boolean value indicating whether x is prime.
