A$*$ search has which of the following properties

It is guaranteed to find the optimal solution if the for every node $n,$ the heuristic value $h(n)$ is larger than the true cost of reaching the goal node from $n$

It is guaranteed to find the optimal solution if the for every node $n,$ the heuristic value $h(n)$ is smaller than the true cost of reaching the goal node from $n$

It can never find the optimal solution unless all the costs are equal to each other

None of the above