Please paste your code and a screenshot of your output!

1. An integer n is divisible by 9 if the sum of its digits is divisible by 9. Develop a program to determine whether or not the following numbers are divisible by 9: n= 154368 n 621594 n-123456 2. A number is said to be perfect if the sum of its divisors (except for itself) is equal to itself. For example, 6 is a perfect number because the sum of its divisors (1 + 2 + 3) is 6. The number 8 is said to be deficient because the sum of its divisors (1 + 2 + 4) is only 7. The number 12 is said to be abundant because the sum of its divisors (1 + 2+ 3 + 4 + 6) is 16. Write a program that lists the factors of the numbers between 1 and 100 and classifies each number as perfect, deficient, or abundant. What to submit: Submit your .cpp file and screenshot of your sample Input and output