In Java please:

k x * Spre> * isPerfectNumber determines (true or false) if a given number is a 'Perfect Number' * A perfect number is one that is equal to the sum of its proper divisors. * Example 1: 6; the proper divisors are 1, 2, 3 ; 1+ 2 + 3 is 6, so 6 IS a perfect number * Example 2: 15; the proper divisors are 1, 3, 5; 1+3+5 is 9, so 15 IS NOT a perfect number k Example 3: 28; the proper divisors are 1, 2, 4, 7, 14; 1 2 +47+14 is 28, so 28 IS a perfect number nuabir the proper divisors are 1, 2, 4, 7, 14, 1+247+14 15 28, 5028 * Precondition: number is a positive integer * The code below is a stub version, you should replace the line of code * labeled TODO with code that achieves the above specification * Hint: find the sum of the proper divisors * public static boolean isPerfectNumber int number) return false; //TODO 4: fix this