Problem 4: Recursion (20 marks) The following unfinished recursive implementation of binary search is supposed to return 1 if target is found in the array arr, and 0 otherwise. Complete the implementation by filling in the base case. Use comments to explain your code. int BinarySearch(int arr[], int len, int target) { if (len