Code to be written in python:
Correct answer will get brainliest! :)

For any positive integer S, if we sum up the squares of the digits of S, we get another integer S1. If we repeat the process, we get another integer S2. We can repeat this process as many times as we want, but it has been proven that the integers generated in this way always eventually reach one of the 10 numbers 0, 1, 4, 16, 20, 37, 42, 58, 89, or 145. Particularly, a positive integer S is said to be happy if one of the integers generated this way is 1. For example, starting with 7 gives the sequence {7, 49, 97, 130, 10, 1}, so 7 is a happy number.


Your task is to write a function compute_happy_numbers(range1, range2) , where range1 and range2 are each tuples of the form (lower_bound, upper_bound), and returns a tuple containing: (1) the number of happy numbers in range1, (2) the number of happy numbers in range2, (3) the number of the range (1 or 2) containing more happy numbers, or None if both ranges have the same number of happy numbers.

def compute_happy_numbers(range1, range2):
"""Your code here"""

Test Cases:
compute_happy_numbers((1,1), (1,1))
(1, 1, None)
compute_happy_numbers((1, 10), (11, 100))
(3, 17, 2)