Assume that there exists a best-first search algorithm in which the objective function is f(n)=(2w)g( n)+wh(n), where f is the evaluation function, g is the path cost from the initial state to node n, and h is the estimated cost (i.e. heuristic) of the shortest path from n to a goal state, What kind of search does this behave like, when w=1 ?.