I’m really struggling with these questions. I have to do them inC++. Thanks!

Background A simple strategy is to try all possible numbers from 2 up to the specified limit. For each candidate number, calculate the sum of the candidate’s divisors. If the difference between the sum and the candidate is not greater than the maximum badness, the number is considered “good enough”. Level 1: Small perfect numbers Begin by writing a program that prints perfect
PayPal Gateway not configured
PayPal Gateway not configured