Consider a 0-1 matrix A with n rows and m columns. We refer to a row or a column of the matrix A as a line. We say that a set of 1's in the matrix A is independent if no two of them appear in the same line. We also say that a set of lines in the matrix is a cover of A if they cover all the l's in the matrix. Using the max-flow min-cut theorem, show that the maximum number of independent l's equals the minimum number of lines in a cover. Consider a 0-1 matrix A with n rows and m columns. We refer to a row or a column of the matrix A as a line. We say that a set of 1's in the matrix A is independent if no two of them appear in the same line. We also say that a set of lines in the matrix is a cover of A if they cover all the l's in the matrix. Using the max-flow min-cut theorem, show that the maximum number of independent l's equals the minimum number of lines in a cover