Q1.

Take ten integer numbers from user input. Now write all numbers in a text file. Then read all numbers and store in an array. Find nth position Fibonacci numbers using that array in a recursive way.

Note: Consider all values in the array as a nth position of Fibonacci series. So you will get 10 numbers from the Fibonacci series as a output.

(Please solve this in C language, easier way)

Thank You

Q1. Take ten integer numbers from user input. Now write all numbers in a text file. Then read all numbers and store in an array. Find nth position Fibonacci numbers using that array in a recursive way. Note: Consider all values in the array as a nth position of Fibonacci series. So you will get 10 numbers from the Fibonacci series as a output