Suppose we have two admissible heuristic functions h$1($n$)$ and $h2(n)($where $n$ is a node in the search tree$)$

$h1(n)+h2(n)$ is admissible

$h1(n{)}^{**}h2(n)$ is admissible

max$(h1(n),h2(n))$ is admissible

None of the above