Please show the simulation of this problem. The simulation must be clear and understandable. Please do not provide any code for the solution. A Constraint graph consists of $3$nodes A$,$ B$,$ and C along with their possible domains. The domains of the variables are given as: A$=\{1,2,3\},$ B$=\{2,3,4,5,6\},$ and C$=\{1,2,3,4,5\}.$ Now you have to employ Backtracking Search with Forward Checking to develop a solution to this CSP$.$ You must use Degree and MRV heuristics wherever needed. Your solution also must satisfy the given constraints:

$($i$)$ A $=$ B

$($ii$)$ A $!=$ C$/2$

$($iii$)$ B $=$ C