Consider a 2D array of integers, so that elements in each row are sorted. The elements of each column are sorted as well. Both rows and columns are sorted in increasing order. Propose a divide and concur approach to find whether a specific value is in the array. Analysis the time complexity of your approach.

Please show step by step. Thanks!

The programming language is C