// This is the pseudocode for an ‘iterative’ binary search procedure CSC 219: Programing in C Lab 6 20 Points Using recursive functions and arrays You are to write two recursive functions in C and a...

refer to attached file


// This is the pseudocode for an ‘iterative’ binary search procedure CSC 219: Programing in C Lab 6 20 Points Using recursive functions and arrays You are to write two recursive functions in C and a main function to test them. 1. The Fibonacci sequence can be defined recursively as follows: a0 = 0, a1 = 1 and for n ≥ 2, an = an-2 + an-1. Write a recursive function that returns the nth term of the Fibonacci sequence. Do not test with a large value of n. 2. Write a recursive function that takes an array of integers and an integer for the number of elements in the array and returns the largest integer in the array, without sorting the array. PAGE 1