For this question, you are provided with a code base that implements informed search in the context of the

Treasure Taking problem. In particular, A$*$ search is implemented. However, the provided implementation

uses h$($n$)=0$ as its heuristic, effectively making it equivalent to simple Breadth$-$First$-$Search.

Your job is to devise two different heuristics to try to improve the performance of A$*$ search on the Treasure

Taking problem.