3. (20 points) Write a templated C++ function called BinarySearch which searches for a target x of any numeric type T, and test it using a sorted vector of type T. Provide the formulas on the number of comparisons in terms of n, the length of the vector, when searching for a target in the best and worst cases. Describe the situations of getting the best and worst cases. What is the classification of the algorithm in the best and worst cases in terms of the Big-O notation