c) The 4-queens problem consists of placing four qucens on a 44 chessboard so that no two queens can attack each other i.e., no two queens are allowed to be placed on the same row, column or diagonal. Each queen is incrementally placed on the chessboard i.e., starting with an empty state. Your task is to represent the 4-queens as a constraint satisfaction problem with 4 variables {Q1,Q2,Q3,Q4}, each of which has domain values {1,2,3,4}. The value represents where on the chessboard we will place the i-th variable, as shown in the following figure: Let first assign Q12. Complete the following table showing the progress of 4 queens search with forward checking. Does it lead to a solution