Write a program that uses recursive functions to (i) compute the sum of array elements, (ii) print the elements. Write a program that displays the Fibonacci numbers up to n terms using (i) a recursive...

Write a program that uses recursive functions to (i) compute the sum of array elements, (ii) print

the elements.

Write a program that displays the Fibonacci numbers up to n terms using (i) a recursive function

named fibonacci_rec, (ii) an iterative function named fibonacci_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?