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.