4.1 Standard exact cover problem (15 pts) In the following matrix, find a set of rows that selects exactly one 1 for each column 1. Simulate the exact cover backtracking algorithm, and show the main steps (each time you extend a partial solution, or backtrack) (10 pts) 2. Provide your solution in the form of a list of row numbers (5 pts) CI C2 C3 C4 C5 C6 C7 ?8 CI C2 C3 C4 C5 C6 C7 ?8 rs 0 0 1 0 T60 1 0 0 0 1 0 0 rs 0 0 1 0 T60 1 0 0 0 1 0 0 C1 C2 C3 C4 C5 C6 C7C8 Cl C2 C3 C4 C5 C6 C7 C8 T3 T40 0 T5 T 6 T3 0 0 1 T40 0 0 0 1 T5 T 6 T8 T8 C1 C2 C3 ?4 ?5 ?6 ?7 ?8 C1 C2 C3 ?4 ?5 ?6 ?7 ?8 T4 T4 T7 SOLUTION 4.1 Standard exact cover problem (15 pts) In the following matrix, find a set of rows that selects exactly one 1 for each column 1. Simulate the exact cover backtracking algorithm, and show the main steps (each time you extend a partial solution, or backtrack) (10 pts) 2. Provide your solution in the form of a list of row numbers (5 pts) CI C2 C3 C4 C5 C6 C7 ?8 CI C2 C3 C4 C5 C6 C7 ?8 rs 0 0 1 0 T60 1 0 0 0 1 0 0 rs 0 0 1 0 T60 1 0 0 0 1 0 0 C1 C2 C3 C4 C5 C6 C7C8 Cl C2 C3 C4 C5 C6 C7 C8 T3 T40 0 T5 T 6 T3 0 0 1 T40 0 0 0 1 T5 T 6 T8 T8 C1 C2 C3 ?4 ?5 ?6 ?7 ?8 C1 C2 C3 ?4 ?5 ?6 ?7 ?8 T4 T4 T7 SOLUTION