QUESTION 21 Consider the recurrence relation: b1 = 2 On = 1 * bn- 1 Listed below is a python recursive function that models the above relationship. Fill in the blanks in the function code and in the program that invokes the function. The function receives a value for n from the python program. The function then returns the value of the nth term to the program. The program prints the nth term. def if n == 1: 2 else: return n* n = (input("Enter a value for n: ")) print ("The ", n, "th term = ", b