Problem 4. Given a vector A of distinct integers in increasing order and an integer k. Write a recursive function that returns true if k occurs in A. Your function must have one recursive call. You need to write the following function with the exact header as shown: bool recFindSorted(const vector &A, int k, int start, int fin); Example: A = {12, 15, 17, 21, 34, 59, 67, 82} and k = 67, then your function will return true. If A is the same, but k = 13, then your function will return false. Youtube video with details about an efficient implementation. Is a given integer in a given array A? (5 min)