1.1 Generalized Exact Coer poblem Solve this generalized exact cover problem, that is: Is there a set of rows containing ezactly one1 in each primary column (c1 through cs), and at most one in each secondary column (c and c7)? Use the EXACTCOVER procedure above, but change line 3 to if A has a 0 primary column... 1 01 0 00 1 01 0 0 0 1 01 0 0 0 0 0 01 1 0 0 1 01 000 0 01 1 0 0 1 0 01 1 0 01 0 1 0 1 1 0 T0 1 0 1 100 1 0 1 10 o 0 1 0 01 1 0 0 0 0 01 1 s 0 1 0 01 1 0 0 0 0 0 1 1 0 0 0 0 01 1 2 An application: Pentomino The Pentomino is a tiling problem involving . 12 different tiles, each of them covering 5 cells . a 6x10 grid The following is one of the many solutions to the Pentomino problem: Design the exact cover matrix for the Pentomino problem what should it be represented by its columns? what should each row of the matrix represent? . what is a solution to the problem? Hint: Pentomino is a regular exact cover