Write a recursive function int fib (int n ) to compute the Fibonacci numbers where n is a positive integer. Write an application (main() function) using command line parameters that calls fib(n) and outputs n, fin(n), fib(n)*1.0/fib(n-1) for n= 3,4,5,6,7,8,9,10,11,12,13,14,15 In a format fprintf (stdout," n=%d\tfib(n)=%d\tfib(n)/fib(n1)= %.4fn ", ,n,fib(n),fib(n)1.0/fib(n1)) The ratio of fib(n) to fib(n-1) for large values of n (larger than say 10 ) is called the golden ratio. Plot a curve between n and golden ratio