#1 Design and implement Prolog CLP program (puzzle 1p) to solve crypt arithmetic problem. As shown below (as discussed in the class), the program is "general" puzzle-solver to solve the general cases of the following cases. You may assume that the length n of the first and second operands are same and the third list (the sum) is n or n+1 You may use the sample code (as your base code) provided in Weekly Activity for CLP (and/or a few sample codes discussed in the class). Each solution should be printed as follow. A 2, P=9, D=1, Y=0, 12,51+19,5]-11,2,01: and so on for the next alternative solutions. Test Cases for puzzlel %% this case has no solution. puzzle! ( [c,s]+[S,E]=(U,T, D] ) . puzzlel (B,I,K,E[R,O,A, D] [R, I, D, E, S]) #1 Design and implement Prolog CLP program (puzzle 1p) to solve crypt arithmetic problem. As shown below (as discussed in the class), the program is "general" puzzle-solver to solve the general cases of the following cases. You may assume that the length n of the first and second operands are same and the third list (the sum) is n or n+1 You may use the sample code (as your base code) provided in Weekly Activity for CLP (and/or a few sample codes discussed in the class). Each solution should be printed as follow. A 2, P=9, D=1, Y=0, 12,51+19,5]-11,2,01: and so on for the next alternative solutions. Test Cases for puzzlel %% this case has no solution. puzzle! ( [c,s]+[S,E]=(U,T, D] ) . puzzlel (B,I,K,E[R,O,A, D] [R, I, D, E, S])