Question

The happy number can be defined as a number which returns 1 when replaced by the sum of the square of each digit. For instance, 13 is a happy number because 12+32=10→12+02=1 . Number 32 is a happy number because 32+22=13→12+32=10→12+02=1 . Other examples of happy numbers are 7, 28, 100, 320. A number is unhappy if the process yields a 4. Which of the following constructs would we need to find out if a number is happy?(1 point)
Responses

for loop

for loop

while loop

while loop

queue

queue

list

Answer 1

We would need a while loop to check if a number is happy.