1. Formulate the problem as CSP and solve using Python Constraint Solver 2. Solve the problem using Generate & Test approach with SWI-Prolog 3. Write and submit a report where you compare approaches 1 and 2 Probleml: Sudoku is a logic-based, combinatorial number-placement puzzle. The objective is to fill a 9x9 grid with digits so that each column, each row, and each of the nine 3x3 sub-grids that compose the grid (also called "boxes", "blocks", "regions", or "sub-squares") contains all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which for a well-posed puzzle has a unique solution. 5 3 195 67 2 195 3 48 9 8 8 4 7 6 8 59 7614 23 4 2 685 3 7 91 6 6 4 1 9 8 287 4 1 96 3 5 3 45 28 6 179 7 9 1. Formulate the problem as CSP and solve using Python Constraint Solver 2. Solve the problem using Generate & Test approach with SWI-Prolog 3. Write and submit a report where you compare approaches 1 and 2 Probleml: Sudoku is a logic-based, combinatorial number-placement puzzle. The objective is to fill a 9x9 grid with digits so that each column, each row, and each of the nine 3x3 sub-grids that compose the grid (also called "boxes", "blocks", "regions", or "sub-squares") contains all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which for a well-posed puzzle has a unique solution. 5 3 195 67 2 195 3 48 9 8 8 4 7 6 8 59 7614 23 4 2 685 3 7 91 6 6 4 1 9 8 287 4 1 96 3 5 3 45 28 6 179 7 9