can someone please help me with the following java question
The input is an N by N matrix of nonnegative integers. Each individual row is a decreasing sequence from left to right. Each individual column is a decreasing sequence from top to bottom.
(a) Implement in Java an efficient algorithm that decides if a number x is in the matrix. Please include in the header of your Java program (using comments) the main ideas of your algorithm.
(b) What is the running time complexity of your algorithm? Justify.
Example of the 4 x 4 matrix: 26 22 17 10
19 16 12 7
12 10 7 4
5 4 2 1