Lab Tasks: Task 1: Define a Python function recursive_fibonacci that takes a positive integer n and returns the nth fibonacci number using recursion.. Write a program that prompts the user to enter an integer n and prints the nth fibonacci number using the defined function. The nth fibonacci number is calculated as follows. Note: Don't include the input statement inside the function. if n = 1 if n = 2 fib(n-1) + fib(n-2) otherwise fib (n)=1 Required output (stick to the input number): Enter the number n: 8 The nth fibonacci number is 21

Fig: 1