python

Problem 1: Write a recursive Python function that returns the sum of the first n integers. f(5) = 1+2+3+4+5 Problem 2: The Fibonacci numbers are the numbers of the following sequence of integer values: 0,1,1,2,3,5,8,13,21,34,55,89, ... In other words: starting with the first two integers (0, 1), any subsequent integer is the result of the sum of the prior two. So the fifth element value 5 is generated by adding 2+3. Hence: fib(n) = fib(n-1)+fib(n-2) e.g., fib(8) = 21 Use recursion to solve this