Computer Science 161 Exercise #4 Due: Wednesday, Feb. 10 (this writeup is provided for information only - the assignment has already been picked up). A number is perfect if it is the sum of the numbers >= 1 and less than itself. The number 6, for example, is perfect, since 6 = 1 + 2 + 3. A number is abundant if the sum is greater than the number, and is deficient if the sum is less than the original number. A prime number is always deficient - the sum in this case is only 1. Write a program (call it perfect.cpp) which will accept a number > 2 from the user and which will inform the user whether the number is perfect, abundant, deficient, or prime. (for prime numbers: you can either announce them as both deficient and prime or simply as prime numbers, as you prefer).