Can you help? I need the code to be in C language.

Problem 3. Fibonacci Sequence (40 points) Fibonacci Sequence is the series of numbers, where each number is the sum of two preceding numbers of the series. These numbers are represented by F(n), where F(n) is the n-th Fibonnacci number. Such a sequence of length 6 is 1,1,2,3,5,8. Thus, formula to calculate the n-th Fibonacoi number is: F(n) - F(n - 1) + F(n -2); where F(0) 0 and F(1) 1 Write a program takes a positive integer, n as input and prints the Fibonacci sequence of length n. Write two user defined functions to find the n-th Fibonacci number and call it from the main function for all integers from 1 to n to print the sequence. You need to: . Write a function to solve it with loops (iterative) 18 points Write a function to solve it with recursion (recursive) - 18 points . Write in the comments which implementation do you think is better and why-4 points You will not get the 80% of the points if you don't use the required approach. Sample Input and Output: (Your code should print the red texts on the screen. Black texts are sample user inputs. No prints to ask for the input.) Sample Input 6 Sample Output Iterative: 112358 Recursive: 112358 Iterative: 112 35 8 13 21 34 55 Recursive: 1123 58 13 21 34 55 Iterative: 1 Recursive: 1 10 1