Derive a solution for the n-Queens problem, for n = 4, using the degree, minimum remaining values and least constraining value heuristics with forward checking where each queen corresponds to a variable of the CSP and all variables have the same domain {1, 2, 3, 4} corresponding to the row in the board. Show the progress of search in a table format where each column represent a queen and each succeeding row represent the remaining values in the domain of each variable after assigning a value to a new variable and circle assigned values. Show, using a similar table format, how the AC-3 algroithm concludes that placing the first queen in row 1 will not yield a feasible solution (show how costraints between the queens lead to a chain of elimination of values from domains of unassigned queens until one queens domain becomes empty).