Every number can be classified as abundant, deficient, or perfect according to the following

definitions:

A number is an abundant number if it is less than the sum of its proper divisors. For example, $12$ is an abundant number because $1+2+3+4+6=16,$ and $16>12.$

A number is a deficient number if it is greater than the sum of its proper divisors. For example,

$9$ is a deficient number because $1+3=4,$ and $4<9.$

A number is a perfect number if it is equal to the sum of its proper divisors. For example, $28$ is a perfect number because $1+2+4+7+14=28,$ and $28=28.$

$($b$)$ Construct an algorithm in pseudocode that will accept an integer, K$($K$>0),$ and output whether K is an abundant number, a deficient number, or a perfect number.

$[6]$