the given eqn
f(N)=g(N)+h(N) belongs to A* algorithm(variant of Best First) in which g(N) i.e the cost of reaching to current node from start node is also considered in addition of h(N). In original greedy best first algorithm only h(N) i.e cost of going from current node to goal node is considered(thats why it is greedy just find the cost to reach the goal node which may not be optimal)
so f(N)=h(N) belongs to greedy best first algorithm hence ans is C