13 1 Deficient Deficient Deficient 10 15 9 Deficient Deficient 16 15 17 1 18 21 Abundant 19 1 Deficient 20 22 Abundant Deficient Deficient 21 11 22 14 23 1 Deficient 24 36 Abundant Deficient Deficient...

In C# thanks!

Extracted text: 13 1 Deficient Deficient Deficient 10 15 9 Deficient Deficient 16 15 17 1 18 21 Abundant 19 1 Deficient 20 22 Abundant Deficient Deficient 21 11 22 14 23 1 Deficient 24 36 Abundant Deficient Deficient 25 6 26 16 Deficient Perfect 27 13 28 28 --[Summary]- Deficient number(s): 22 Abundant number(s): 4 Perfect number(s): 2 ---- Total number(s): 28 3 45


Extracted text: Task: A perfect number is a positive integer that is equal to the sum of its proper divisors (or factors). The smallest perfect number is 6, which is the sum of 1, 2, and 3. Other perfect numbers are 28, 496, and 8,128. An abundant number (or excessive number, or efficient number) is a number for which the sum of its proper divisors (or factors) is greater than the number itself. The integer 12 is the first abundant number. Its proper divisors are 1, 2, 3, 4 and 6 for a total of 16. A deficient number (or defective number) is a number for which the sum of its proper divisors (or factors) is less than the number itself. The integer 9 is an example of a deficient number for which the sum of its proper divisors (or factors) is for a total of 4 i.e., 1 + 3. Based on the information provided, create a program that will generate the sample screen output below: Enter how many number(s) to be checked: 28 Number Sum of Factors Remarks 1 Deficient Deficient Deficient 2 1 3 1 Deficient Deficient 4 3 1 Perfect Deficient Deficient Deficient 6. 6. 7 1 8. 7 9 4 Deficient Deficient Abundant 11 1 16 O-2