Please write a code in C that will give the results of the output included.

Greek mathematicians took a special interest in numbers that are equal to the sum of their proper divisors. A proper divisor of n is any number that evenly divides n that is less than n itself. For example, 6 is a perfect number because it is the sum of 1,2 , and 3 which are the factors of 6 that are less than 6 . Similarly, the number 28 is a perfect number because 1+2+4+7+14 add up 28. Write a program that contains a function called isPerfect that takes an integer n and returns true (1) if n is perfect and false (0) otherwise. Your program should output all the perfect numbers between 1 and 100,000. There is no need to input the number 100,000 . A sample run of the program: c:1 Microsoft Visual Studio Debug Console The perfect numbers between 1 and 100,000: 6284968128