Examine how constraint satisfaction problems differ from other search problems with respect to the type of states they use during the search. Question 11Answer a. Constraint satisfaction problems use states defined by heuristics only, whereas other search problems use states defined by explicit rules. b. Other search problems use constraint-based states while constraint satisfaction problems do not impose any constraints on the states. c. There is no difference; constraint satisfaction problems use states in the same way as all other search problems. d. Constraint satisfaction problems use states that are defined by the values of a set of variables and the goal is to find a set of values for those variables that satisfy all constraints, in contrast to other search problems that may not have such explicitly defined variables and constraints.