which search is complete and optimal when h(n) is consistent code example

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

A* using graph-search is optimal