The heuristic path algorithm is a best-first search in which the objective function is f(n) = (2 - w)g(n) + wh(n). For what values of w is this algorithm guaranteed to be optimal? (You may assume that h is admissible.) What kind of search does this perform when w = O? When w = l? When w = 2?