Write two programs (40 points) of the Fibonacci number function. The first one is the recursive function, and the second one is the iterative function.

Fib (1) is 1

Fib (2) is 1

Fib (N) is Fib (N-2) + Fib (N-1), for N > 2

Use C language and use this now :

Run the program with input of N, where N will be 1, 2, 5, 10, 50, and 100. Compare the processing time of the both program