1. Suppose we implement two-dimensional dynamic array X in Figure 1 using two one-dimensional arrays in the class shown below. The values are stored in ascending order where X[row][column] j (N-1) and X[row][column] i (N-1).

Develop a search algorithm in pseudo code that searches a target value in the above data structure in O(N). Explaining how you came up with your answer will help me determine credit; however, this is optional.

column 0 2 3 4 N-1 N-2 0 0 2 3 4 N-1 N-2 1 0 3 4 N-1 N-2 2 0 2 3 4 N-1 N-2 3 3 ... ... 0 2 3 4 N-1 N-2 N-1 0 2 3 4 N-1 N-2 N