The Means-end-analysis technique is a strategy to control search in problem-solving. Given a current state and a goal state, an action is chosen which will reduce the difference between the two. The action is performed on the current state to produce a new state, and the process is recursively applied to this new state and the goal state.
Constraint satisfaction problems are mathematical questions defined as a set of objects whose state must satisfy a number of constraints.
The general idea of Branch and bound algorithm is a BFS-like search for the optimal solution, but not all nodes get expanded . Rather, a carefully selected criterion determines which node to expand and when, and another criterion tells the algorithm when an optimal solution has been found.
Steepest-Ascent Hill climbing: It first examines all the neighboring nodes and then selects the node closest to the solution state as of next node
so clearly option A is correct ans