Design and write a divide & conquer algorithm that, given an array a of n distinct order, will find if there is some i such integers which is already sorted into ascending that ai] i, in worst-case o(log n) time.

can you include the statments that complete the question ?

solution:

the right option is a

to adding   a new row to a table we   have to do process last table cell and pressing tab.

this is the process to add new row in the cell:

* to add a row below the cell, click insert below in the rows and columns group.

thus this is the required right answer.