Suppose you have three candidate heuristic functions, hi(n), h2(n) and h3(n). All of them are consistent (and therefore admissible/optimistic). You do not know whether or not any of them dominate the others Which of the following is the best choice of heuristic function you could use for A* search? Select one: For each node n, take h(n mean(hi(n), h2(n), hz(n)) For each node n, take h(n) max (hi(n), h2(n), h3(n)) For each node n, take h(n) = min (hl (n), h2(n),h3(n)) Pick whichever heuristic has the maximum value for any n. Check