This exercise explores why heuristic functions used in a graph$-$search A$*$ have to be consistent. Recall that in a graph$-$search method, newly$-$created search tree nodes with a state that has appeared before will be dropped, wheres in a tree$-$search method, search tree nodes are allowed to have identical states, leading to redundant paths. $($The authors of the textbook