NEEDED IN C++. As you recall, a prime number is a positiveinteger that is evenly divisible only by 1 and itself. A semi-primeis a number that is the product of two prime numbers and is evenlydivisible only by 1 and these two prime numbers. Semi-primes areused in various encryption schemes and are, therefore, of interestto computer scientists. We will write a program to find all of thesemi-primes less than 100,000,000. To do this, you will write anduse the following functions. You must not use any built-infunctions. unsigned numFactors ( unsigned long UL); This functionwill take an unsigned long, UL and
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured