Python

Define a recursive function named evaluate(n) that takes a positive integer as a parameter and returns a tuple containing the result of the following series and the number of recursive calls made, in that order. series(i) = 1/2 + 2/3 + 3/4 + 5/6 + 7/8 ... + n/(n+1) Note: The first function call does not count as a recursive call. You may not use loops of any kind. You must use recursion to solve this problem. You can assume that the parameter integer is non-negative. For example: Test Result data = evaluate(1) print("Total = {: .4f}".format(data[@])) print("Number of recursive calls = {}".format(data[1])) Total = 0.5000 Number of recursive calls = 0 data = evaluate(2) print("Total = {: .4f}".format(data[@])) print("Number of recursive calls = {}".format(data[1])) Total = 1.1667 Number of recursive calls = 1 data - evaluate(7) print("Total = {:.4f}".Format(data[0])) print("Number of recursive calls = {}".format(data[1])) Total = 5.2821 Number of recursive calls = 6