Using C++ and Using the given functions please

Thanks

B-smooth Numbers A number is B-smooth https://en.wikipedia.org/wiki/Smooth _number if none of its prime factors are greater than the value B. For example, the list of 5-smooth numbers (numbers whose prime factors are 5 or less) are listed in https://oeis.org/A051037. 30, as seen above, is a 5-smooth number. It would also be 6-smooth, 7-smooth, etc. k-hyperperfect numbers We saw counting the divisors of a number in project 2. Here we are going to sum all the divisors of a number. A number n is k hyperperfect for some k if the following equality holds: n = 1 + k*(sum-of-divisors(n)-n-1) For example, 28 is 1-hyperperfect, meaning that the sum of its divisors (1+2+4+7+14+28) minus the 28 itself equals 28. These were traditionally called perfect numbers . 1 is 2-hyperperfect. Applying the formula: o sum of divisors(21) (1+3+7+21) 32 The value in parentheses is then (32-21-1) k=2, so 2 *10=20 20+1=21. 10 o https://en.wikipedia.org/wiki/Hyperperfect number gives a list of k-hyperperfect numbers Project Description / Specification yarning First, a warning. In this and in all future projects we will provide exactly our function specifications: the function name, its return type, its arguments and each argument's type. The functions will be tested individually in Mimir using these exact function specifications. If you do not follow the function