which function will select the lowest expansion node at first for evaluation code example

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

A* using graph-search is optimal