Please explain your process.

1. Given a sorted array of n comparable items A, and a search value key, return the position (array index) of key in A if it is present, or -1 if it is not present. If key is present in A, your algorithm must run in order O(log k) time, where k is the location of key in A. Otherwise, if key is not present, your algorithm must run in O(log n) time. Turn in: a. A written description of your algorithm, along with an explanation for why it works, and an analysis of your run time. b. A C++ implementation of your solution. Use: int fastFind(vector &A, double key);' as your function prototype