In C++, thumbs up for the correct answer ! Thanks!

Question 1 Write a recursive function defined by the following recursive formula: foo (Y, X) = Y if X=1 if X=Y (foo (Y-1, X-1) + 4* foo ( Y-1, X)) if Y>X > 1 Write a driver to print out the value for foo (5.3) and foo (6,5). In addition, print out the total number of recursive function calls in each case. Question 2 Implement a recursive function that conducts a binary search with the following interface: bool Binary Search (int info[], int x, int from Loc, int toLoc, int &step), info[fromLoc, toLoc) stores an ordered list // step: the number of search step of this binary search X -- a search item // if x is in the list, return true; otherwise, return false Test cases: #define LEN 10000 int info[LEN): for(int 1-0; i