CSP. Consider the following binary-constraint network: There are 4 variables: A, B, C, D, with the domains:
$D_A = \{1, 2, 5\}$,
$D_B = \{3, 4, 9\}$,
$D_C = \{2, 3, 5, 6, 7, 9\}$,
$D_D = \{3, 5, 7\}$.
The constraints are:
A > B,
B >= C,
C = D - 2,
\begin{itemize}
\item Write the constraints in a relational form.
\item draw the constraint graph.
\item Show the domains of the variables after running arc-consistency.
\item Use backtracking tree search for CSP to find all the solution(s) if any, list all the solution(s) you found. Draw the search tree without using forward checking.
\end{itemize}
