True or False: A recursive function without an appropriate base case to stop recursion will run forever.

A recursive implementation of the Fibonacci function is preferred over an iterative implementation. O True O False Which of the following is a valid algorithm for summing all odd integers in the range [1.n O f(n) if(n-1) else if (n is even) f(n-1) else f(n-2)+1 O f(n) if(n-0) else if (n is even) f(n-1) else f(n-2)+n O f(n) if(n-1) else if (n is even) f(n-2)+n else f(n-1) O f(n) if(n-1) else if (n is even) f(n-1) else f(n-2)+n Choose the correct option for the base case in place of ? for the following binary search for an item on a sequence S in the range [ow,high] BinarySearch(item, S, low, high) if(?) false else mid (low+high)/2 if(S(mid)-item) true else if S(mid)>item) BinarySearch(item, S, low, mid-1) else BinarySearch(item, S, mid+1,high) (low==high) (low>high) (lown) else return mid return f(a,mid-1,n); return f(mid+1,b,n)