Can you please help me to solve this problem?

Thank you

1. An integer number is said to be a perfect number if its factors, including 1 (but not the number itself), sum to the number. For example, 6 is a perfect number, because 6=1+2+3. Write method Perfect that determines whether number is a perfect number. Use this method in an application that determines and displays all the perfect numbers between 2 and 1000. Display the factors of each perfect number to confirm that the number is indeed perfect. OUTPUT: run: 6 is perfect. Factors: 1 2 3 28 is perfect Factors: 1 2 4 7 14 496 is perfect. Factors: 1 2 4 8 16 31 62 124 248 BUILD SUCCESSFUL (total time: 0 seconds) 1. An integer number is said to be a perfect number if its factors, including 1 (but not the number itself), sum to the number. For example, 6 is a perfect number, because 6=1+2+3. Write method Perfect that determines whether number is a perfect number. Use this method in an application that determines and displays all the perfect numbers between 2 and 1000. Display the factors of each perfect number to confirm that the number is indeed perfect. OUTPUT: run: 6 is perfect. Factors: 1 2 3 28 is perfect Factors: 1 2 4 7 14 496 is perfect. Factors: 1 2 4 8 16 31 62 124 248 BUILD SUCCESSFUL (total time: 0 seconds)