This is a question on Abuja's textbook "Network Flows", I'll be great appreciated if anyone could solve this!

6.46. Consider a 0-1 matrix H with n, rows and n2 columns. We refer to a row or a column of the matrix H as a line. We say that a set of 1's in the matrix H 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 H if they include (i.e., "cover"') all the l's in the matrix. Show that the max- imum number of independent l's equals the minimum number of lines in a cover. (Hint: Use the max-flow min-cut theorem on an appropriately defined network.) 6.46. Consider a 0-1 matrix H with n, rows and n2 columns. We refer to a row or a column of the matrix H as a line. We say that a set of 1's in the matrix H 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 H if they include (i.e., "cover"') all the l's in the matrix. Show that the max- imum number of independent l's equals the minimum number of lines in a cover. (Hint: Use the max-flow min-cut theorem on an appropriately defined network.)