use the divide and conquer technique to develop an efficient algorithm that finds the index of the turning point in a sequence of at least three integers. the sequence consists of an increasing subsequence of at least one integer and is followed by a decreasing subsequence of at least one integer. for example,