The sequence of Fibonacci numbers looks like this: 1, 1, 2, 3, 5, 8, 13, 21, where each number after the first two is the sum of the two preceding numbers. The first 2 numbers are always 1 and 1. Write a recursive function to calculate the first n Fibonacci numbers.The sequence of Fibonacci numbers looks like this: 1, 1, 2, 3, 5, 8, 13, 21, where each number after the first two is the sum of the two preceding numbers. The first 2 numbers are always 1 and 1. Write a recursive function to calculate the first n Fibonacci numbers.