Activity I: Abundant Commas C++

The first problem you will solve is to identify so-called abundant numbers. Mathematically, an abundant number is one where thesumof its proper divisors (positive divisors other than the number itself) is greater than the number. For example, n=12 is abundant because the sum of its divisors, 16 (1+2+3+4+6) > 12. The number n=15 is NOT abundant because its proper divisors do NOT sum to more than 15 (i.e. 1+3+5=9 =>

Beyond determining whether a single number is "abundant", this assignment asks that you take any sequence of positive integers, separated by spaces and ending with a 0 to indicate the last value in the sequence, and find a.)HOW MANYnumbers in the sequence are abundant and b.) List the 3MOSTabundant numbers and their abundance.

For example: If we provide the input 18 15 12 48 32 36 0 your program should produce the following output:

Abundant number count: 4

Top 3 most abundant numbers:

48 : 76

36 : 55

18 : 21

ABSOLUTELY NO ARRAY or string/vector/etc. usage is allowed!