Extracted text: Instruction: Write a Java program that reads a positive, non zero integer as input and checks if the integer is deficient, perfect, or abundant. A positive, non-zero integer, N, is said to be perfect it the sum of its positive proper divisors (i.e., the positive integers, other than N itself, that divide N exactly) is equal to the number itself. If this sum is less than N, the number is said to be deficient. It the sum is greater than N, the number is said to be abundant. The first few perfect numbers are 6, 28, 496, and 8128. | Illustrations: Number 6. 28 For example, the number 6 is perfect, since 6 = 1 + 2 + 3, the number 8 is deficient, since 8>1 + 2+ 4, while the nurmber 12 is abundant, since 12<1+2+3+4+ 6.="" |="" factors="" of="" the="" number="" less="" than="" itself="" |="" sum="" of="" factors="" 3.="" 2.="" 1="" 14,="" 7,="" 4,="" 2,="" 1="" 6.="" 28="" sample="" input/output:="" depicled="" below="" are="" sample="" oulputs="" when="" the="" program="" is="" execuled="" (ihe="" ilems="" in="" bold="" characters="" are="" input="" from="" the="" user,="" while="" the="" items="" in="" bold="" italic="" are="" calculated="" and="" printed="" by="" the="" program):="" input="" n:="" 5="" input="" n:="" 6="" 6="" is="" perfect.="" input="" n:="" 18="" 5="" is="" deficient.="" 18="" is="" abundant.="" required:="" the="" java="" file="" (familyname_perfect.java)="" containing="" the="" code="" and="" 3="" image="" files="" (sample1,="" sample2="" and="" sample3)="" containing="" different="" sample="" input/output="" of="" the="">