The heuristic path algorithm is a best-first search in which f(n)=(2−w)g(n)+wh(n).
a) true
b) false