Let h1, h2, ..., hn ben consistent heuristics for a search problem. None of the heuristics dominate each other. Let hmax = max(h1, h2, ..., hn). Prove or give a counterexample: hmax is consistent. Let h1, h2, ..., hn ben consistent heuristics for a search problem. None of the heuristics dominate each other. Let hmax = max(h1, h2, ..., hn). Prove or give a counterexample: hmax is consistent