3) Please answer full question (a-d) for thumbs up.

a) Is it true that all admissible heuristics are equal, in the sense that A* will search the states in the same order no matter what the admissible heuristic is? Explain your reasoning.

b) Is Breadth-First search complete if the state space has infinite depth but a finite branching factor?

c) What CSP algorithm would you use when given an incremental formulation of a CSP problem?

d) In what sense is IDA* preferable to A*?