****python****

Q1.

Write a recursive function that returns the sum of all numbers up to and including the given value.

This function has to be recursive; you may not use loops!

For example:

Test	Result
print('%d : %d' % (5, sum_up_to(5)))	5 : 15

Q2,

Write a recursive function that counts the number of odd integers in a given list.

This function has to be recursive; you may not use loops!

For example:

Test	Result
print('%s : %d' % ([2, 3, 5, 6], count_odd([2, 3, 5, 6])))	[2, 3, 5, 6] : 2

Q3.

Write a recursive Python function, given a non-negative integer N, to calculate and return the sum of its digits.

Hint: Mod (%) by 10 gives you the rightmost digit (126 % 10 is 6), while doing integer division by 10 removes the rightmost digit (126 / 10 is 12).

This function has to be recursive; you may not use loops! This function takes in one integer and returns one integer.

For example:

Test	Result
print(234, ":", sum_digits(234))	234 : 9

Q4.

Write a recursive function to compute the following series:

This function has to be recursive; you may not use loops!

For example:

Test	Result
print('%d : %.6f' %( 2, m(2)))	2 : 1.500000

Thank you!