Consider a variant of the array in previous problem. an array a[1: : n] has a property that it rst rises monotonically up to some point i then it monotonically decreases until some point j and then rises again. that is a[k] < a[k + 1] for all k 2 [1: : i 1] [ [j: : n 1] and a[k] > a[k + 1] if i k < j. can we still nd i in o(log n) time? if not what is the minimum time required?