7. An integer is called a prime number if a natural number that hasexactly two distinct natural number divisors: 1 and itself. Forexample, 2, 3, 5, 7, 11, 13 are prime numbers. Write a recursivefunction called isPrime to determine whether an integer is a primenumber. The recursive function isPrime has two parameters: thefirst one is the test number p and the second one is a divisor qwhich is greater or equal to 2 and less than p. The function willreturn 1 if p=q (it is better if (q*q>p), why?) and return 0 ifp%q = 0 (note that, in this
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured