Which search method will expand the node based on minimal heuristic cost code example

Example: Which search is complete and optimal when h(n) is consistent?

A* using graph-search is optimal