1. Write a program that displays the Fibonacci numbers up to n terms using (i) a recursive function named fi bonaccirec, (ii) an iterative function named fi bonacci_ite. The value of n is set by user input. The program must track and print the total number of recursive calls and loop iterations made by the two functions. As you increase the value of n, what observations can you make from the results?
2. Name three expressions or objects that evaluate to a pointer.
3. If p, which is set to &x in main, is passed as an argument to a function, can the latter change the value of x?