Trace the execution of the backtracking CSP algorithm over the $8-$Queen problem. You must use the Most constrained variable OR Most constraining variable heuristic functions AND the Least constraining value. For each iteration show the value of each variable $($queen $)$ with respect to which raw it is located, also show the values of the Most constrained variable OR Most constraining variable, AND the Least constraining value. If the number of iterations exceeds $50$ you can stop the tracing. At the end of the tracing draw the resulting grid. Use C $++$