Data Structure Java Help Program creates NxN matrix of unique value in correct format and determines if X is located in the matrix in O(N) or better The input is an N by N matrix of numbers that is already in memory. Each individual row is increasing from left to right. Each individual column is increasing from top to bottom. Give an O(N) worst-case algorithm that decides if a number X is in the matrix.