Use python You will write two functions in this challenge. First write a function called rec_dig_sum that takes in an integer and returns the recursive digit sum of that number.
Examples of recursive digit sums:
101 => 1+0+1 = 2
191 => 1+9+1 = 11 => 1+1 = 2
5697 => 5+6+9+7 = 27 => 2+7 = 9
Then use that function within another function called distr_of_rec_digit_sums, that returns a dictionary where the keys are recursive digit sums, and the values are the counts of those digit sums occurring between a low and high (inclusive) range of input numbers. Assume low and high are positive integers where high is greater than low, and neither low nor high are negative. Your function should return a dictionary, not just print it.
code
def rec_dig_sum(n):
'''
Returns the recursive digit sum of an integer.
Parameter

n: int
Returns

rec_dig_sum: int
the recursive digit sum of the input n
'''
pass
def distr_of_rec_digit_sums(low=0, high=1500):
'''
Returns a dictionary representing the counts
of recursive digit sums within a given range.
Parameters

low: int
an integer, 0 or positive, representing
the lowest value in the range of integers
for which finding the recursive digit sum
high: int
a positive integer greater than low, the
inclusive upper bound for which finding
the recursive digit sum
Returns

dict_of_rec_dig_sums: {int:int}
returns a dictionary where the keys are
the recursive digit sums and the values
are the counts of those digit sums occurring
'''
pass