Please put everything in one method that returns a boolean value for the question:

I found many similar answers for the questions but they are not working!

You are working on problem set: Chapter 11 (0 Pause) 7 num isHappyNumber 1 public static boolean isHappyNumber(int num) { 2 int rem = 0, sum = 0 , a=0; 3 4 while(num > 0){ 5 rem = num%10; 6 sum = sum + (rem*rem); num/10; 8} 9 19 if(a == 1) { 11 return true; 12 } 13 else { 14 return false; 15 } 16 17 } 18 Language/Type: Java TreeSet collections Write a method named isHappyNumber that returns whether a given integer is "happy". An integer is "happy" if repeatedly summing the squares of its digits eventually leads to the number 1. For example, 139 is happy because: . . 12+ 32 +92 = 91 92 + 12 = 82 82 + 22 = 68 62 +82 = 100 12+02 +02 = 1 Method: Write a Java method as described, not a complete program or class. . Submit $ By contrast, 4 is not happy because: . . 42 = 16 12 +62 = 37 32 +72 = 58 52 +82 = 89 82 +92 = 145 12 +42 +52 = 42 42 + 22 = 20 22+ + O2 = 4