This constraint satisfaction problem is a simplified version of Sudoku in a 44 matrix. The goal is to fill in each cell in the matrix with a number between 1 and 4 in such a way that no number is repeated on the same column or on the same row. To save you time, some cells have already been filled in with a value. The remaining ones have been named with a letter for easy reference. These letters, A, B, C, D,E,F and G, are the variables in the constraint satisfaction problem. Variables: A, B, C, D, E, F, and G. Domain: The domain of each variable is {1,2,3,4}. Constraints: There is a constraint between each pair of cells P and Q that belong to the same column or to the same row of the matrix stating that the values assigned to the two cells cannot be equal. Answer the questions below as if you were an agent following the CSP algorithms we studied in class. 4A [5\%] Fill in the table below (some values are provided as examples to guide you. For instance, A has two remaining values, 1 and 4 , and it has constraints with four other variables B, C, D, G.)