C$++$

The Binary Search Challenge

Write a recursive function int $r$ BinarySearch$($const vector $$ int $>$&$v,$ int low, int

high, int target$)$ that uses a binary search to find the index of target in the sorted

vector $v.$ If target is not in the vector, the function should return $-1.$ You can

assume that $v$ will not contain duplicate values.

The Subarray Sum Challenge

Given a vector of integers v$,$ a start index start, and a target value target, write a

recursive function bool rSubsetSum$($const vectorv