We use the term "line" of a matrix to mean either a row or a column. Given an n times n matrix of 0's and 1's, show how to find a smallest number k of lines such that every "1" entry of the matrix is contained in one of the selected lines. Analyze the runtime of your algorithm. Show that k equals the largest number of "1" entries no two of which are in a common line