code in python please

i need:

1-simple backtracking

2- backtracking with the MRV heuristic

3- forward checking

4- forward checking with the MRV heuristic

Tenner Grid is a Mathematical puzzle that consists of a rectangular gnid of width ten cells. The task is to fill in the grid so that each row contains the numbers 0 to 9 . Numbers must not be repeated in rows. In columns the numbers may be repeated and the numbers in a column must add to a given target sum. Therefore, the bottom numbers give the sum of the aumbers in column. The digits in contiguous cells (even diagonally contiguoes cells) must be different. The rules of Tenner Grids marh pucales: 1. Numbers appear only once in a row. 2. Numbers may be repeated in columns. 3. Numbers in the columns must add up to the given sums. 4. Numbers in connecting cells must be different. Write an Al program to generate and solve the game Tenter Grial by modelling it as constraint satisfaction problem. Your program must solve a randomly generated Teuner Grid Purale in Simple Backltracking, Burcktracking with the MRV henristic, Forward chesking, Forward checling with MRV hewristic. You can configure your program to either solve 10 by 3 Tenner Grid Purales, 10 by 4 Tenner Grid Puzzles, 10 by 5 Tenner Grid Purales, or 10 by 6 Tenner Grid Purzles. For each algorithm, show the initial state irandomly generated state), final CSP Tenner variable assignments, number of variable assignments and number of consistency checks, the solution found (final state), and time used to solve the problem. Conduct a comparison of various CSP alporithms (Backtracking. BT+MRV. Forward Checking, and FC+MRV) on Tenner Grid problem. Analyze the median number of consistency checks (over five runs) requited to solve the problem and show the results in term of which algorithms is better to solve the