Write a program that implements the Exact Cover algorithm as described in Chapter 2
of the textbook. The program should take a binary matrix as input and output all
combinations of rows that cover each column exactly once.
Task 2 (3 points):
Handwrite the step-by-step execution of the program using line numbers for the following
example:
Matrix representation for 4 different sets:
[
[1, 0, 1, 0],
[0, 1, 0, 1],
[1, 1, 0, 0],
[0, 0, 1, 1]
]