3) Solving Discrete Constraint Satisfaction Problems peer-reviewed Mahin Write a program which finds solution to the following 3 hierarchically organized constraint satisfaction problems, involving 15 variables {A,B,C,,N,O} which can take integer values in {1,,50}. a. Problem A: Find a solution to the constraint satisfaction problem involving the six variables A, B, C, D, E and F and constraints C1,,C4:

(C1) A=B+C+E+F

(C2) D=E+F+21

(C3) D**2=E*E*A + 417

(C4) E+F < A