uestion 3 [1 ptl: Consider the crypto-arithmetic puzzle shown in Figure 1 where each letter represents a single digit and no leading zeros are allowed (no two letters shall have the same values) Model this puzzle as a constraint satisfaction problem. List the variables, their domains, and the constraints [0.5 pt Variables: {M,S,O,E,N,R,D,Y) Domain: 10,1,2,3,4,5,6,7,8,9) Constraints: AlldiffM,S,O,E,N,R,D,Y) . forward checking to find a solution to the map coloring problem. Please use Table 1 to show the assignment of each variable till the solution to be found (only need to report one solution). Use "most constrained variable, most constraining value" in your approach. [0.5 ptl S E N D + M O R E Figure 1: Crypto-arithmetic puzzle Table 1