Stuck on this question

An array A, has the following n elements: k₁; k₂; ; k_l; q₁; q₂; ; q_m, where the sequence k₁; k₂; ; k_l is monotonically increasing and the sequence k_l ; q₁; q₂; ; q_m is monotonically decreasing. Also, l + m = n and l is unknown. Present an O(log n) (hint: divide and conquer) time function FindTransition(A, 1, n) to determine l, not the element value, but its position. For example, if the input is 2; 5; 11; 24; 8; 1, the answer is l = 4.