Consider a heuristic graph searching algorithm; explain how the accuracy of the estimate $h\left(\mathbf{x}_i\right)$ of the path cost from the current node $\mathbf{x}_i$ to the end node influences the search behavior. Specify under which conditions the optimality of the search is guaranteed.