MIPS Programming

Perfect number checking:

The task is to write a MIPS program to check and classify a positive integer as abundant, perfect, or deficient.

Definition: Let P(n) be the sum of all factors of n excluding n itself.

-if P(n) > n, then n is an abundant number

-if P(n) = n, then n is a perfect number

-if P(n) < n, then n is a deficient number

Example: n = 231, P(n) = 1 + 3 + 7 + 11 + 21 + 33 + 77 = 153 < 231 = n 231 is a deficient number

Your MIPS program should accept an integer from standard input, find factors of the input number, perform the checking, and finally print out the list of factors (excluding the number itself) as well as the checking result. See sample runs below for required format.

Sample runs:

Please enter a positive int: 6

The factors are: 1 2 3 6: perfect number

Please enter a positive int: 24

The factors are: 1 2 3 4 6 8 12 24: abundant number

Please enter a positive int: 231

The factors are: 1 3 7 11 21 33 77 231: deficient number

Notes:

The can assume that input is always a positive integer that fits in a 32-bit register;

The code must be very well commented;

The code will need to deal with standard input/output. You might find the system call of heap allocation useful, too.