Create a C++ program:

1) Create a function that does the hard work of determining "perfect number-ness"

• The one input parameter is an integer value which is the number value to test (Let's call it n)
• Sum up all the divisors of the number from 1 to n-1 (Let's call it sum)
• Return a boolean flag which indicates if the sum is equal to the test number (n equals sum)

2) In the main function, print all the perfect numbers from 1 to 10000

• Create a loop that iterates from values 1 to 10000
• For each iteration, call the function and use its result accordingly
• No user input is required or allowed
• 6, 28, 496, and 8128 are the only four values which are perfect numbers