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$)?$

$($Yes$/$No and explain$)$

Group of answer choices

Yes it will find the global optimum path but NOT using the minimum required node expansions

No it is not guaranteed not find the global optimum path