Write a recursive function named binarySearch that accepts a reference to a sorted vector of integers and an integer target value and uses a recursive binary search algorithm to find and return an index at which that target value is found in the vector. If the target value is not found in the vector, return -1. The following code shows some example calls and their expected return values:           // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16vectorv {-4, 2, 7, 10, 15, 20, 22, 25, 30, 36, 42, 50, 56, 68, 85, 92, 103};​intindex=binarySearch(v, 42); // 10intindex=binarySearch(v, 66); // -1   You should assume that the vector's elements are already sorted; you do not need to handle the case of an unsorted vector. Your function must be recursive and must use a binary search algorithm. Do not use loops or auxiliary data structures.

Write a function that is given a list  of int id’s as a parameter,  the id of the person looked for, and the length of the array.  Use the data: Bob     123456            89 Suki     234567            77 Felix    345678            55        Julie     456789            67 The function  searches the id array and returns the index of the id or –1 if the id does not exist.  The main program outputs the name of the person at that index or a message that the person was not found.  The name array (up to length number of students) and id array are declared in  function main.  Show all the declarations and the actual call.  A sample run may look like the following:             int SearchPerson(const int id[], int length,int who);  Enter the id of the person                   345678  That person is:                                     Felix    with a mark of             55  Enter the id of the person                   444444  That person does not exist.   in C++ please use basic coding I'm not…

Write a recursive function that sorts an array using selection sort algorithm   ** in C++ please. Thanks

In C++