In a M×N matrix all non zero entries are covered in a rows and b columns , the rest ( M-a rows , N-b columns ) have zero entries. Then the maximum number of non zero entries such that no two are in same row/ column can be found out from the following cases
Case 1 : a> b . No of non zero rows > non of no zero columns in this case you can have only 1 entry per a no of rows and 1 entry per b number of columns . But since a > b you are bound to have atleast 2 non zero entries in the same column. ( Visualise matrix 3×2 ) . So in this case , one row will become zero . So in this case max entries can be b only
Case 2 : a<b . For similar reasons as above , opposite variable one column will become zero . So b cannot be greater than a . So in this case max entries can be a only
Case 3 : a=b . Now this can be easy . Think of simple row echelon form matrix . Now we can say max no of non zero entries can be a/b
Then max entries <= min(a,b) . Option D .we cannot have max entries <=min( M-a , N-b) because it will refer to rows and columns other than a and b which may or may not be equal to a and b .