Please solve using python programming. Thanks.

Enterpoaitivc irteqar: 2 Eibonacei number: 13 FIGURE 6.24 Possible outcome of Exercise 10. 10. Fibonacci Sequence The famous Fibonacci sequence, 1, 1,2,3,5,8,13 begins with two 1s. After that, each number is the sum of the preceding two numbers. Write a program using a recursive function that requests an integer n as input and then displays the nth number of the Fibonacci sequence. See Fig. 6.24 11. Greatest Common Divisor The greatest common divisor (GCD) ot two nonnegative integers is the largest integer that divides both numbers. For instance, GCD (6, 15) 3 and GCD (9, 0)9. The standard aigonthm tor calculating the GCD of two numbers depends on the fact that GCD m n -GCD(n, m % n where % 1s the modulus operator. Wrte a program that requests two postive integers as input and displays their GCD. Use a recursive tunction (with n- 0 as the terminating case) to calculate the GCD. See Fig. 6.25D Inter the first integer: Enter the ceand intager: 14 FIGURE 6.25 Possible outcome of Exercise 11