Consider a best first search method which sorts our fringe list on f$($n$)$ with f$($n$)=$h$($n$),$ where h$($n$)$ is an admissible heuristic, Will this approach converge to the global optimum $($i$.$e$.$ the shortest path$)?$