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, 7 8 9 20 40 30 15 10 The integer 40 is the turning point and its index = 4 (starting from zero).