Design a recursive function named recSum that accepts two non$-$negative arguments as the parameters n and m and returns the sum of all the integers between n and m$.$

For example, if you call the function using $10$ and $15,$ then the function will return the sum of $10,11,12,13,14,$ and $15.$

Sample function call and output:$$

result $=$ recSum$(3,6)$

print$($result$)$

Output: $18$

$-$ Develop a function named recFib that returns the result for the Fibonacci sequenceLinks to an external site. to n terms using a recursive algorithm.$$

For example, if n is $8,$ the result will be $21$: $0,1,1,2,3,5,8,13,21.$

The function will generate these numbers based on the Fibonacci series $0,1,1,2,3,5,8,13,21$ and stop at the number $21$ since this number is the $8$th one.

Sample function call and output:

result $=$ recFib$(5)$

print$($result$)$

Output: $7$

Explanation: the function will generate five items of the Fibonacci series, which are $0,1,1,2,3.$ The function will sum those values as they are being generated, and the result will be $0+1+1+2+3,$ which is $7.$

Write a function named recPrint that prints the below figure using a recursive algorithm:

Sample function call and output:

recPrint$()$

Output:

$*****$

$****$

$***$

$$

$**$

Write a Python program that asks the user to input n integer numbers and save them in the list numList, then design a recursive function for each of the following $($use a meaningful$$ name for each of these functions$)$:$$

Find and return the sum of all elements in numList.$$

Find and return the sum of all even elements in numList.

Find and return the sum of all elements at odd indices in numList.

Find the maximum element in the list.

Find the length of the list.