1. Tree searching strategies: We can model the searching problem as a tree. Any internal node has at most b children. We define 3 functions. g(n) = the path length from the…
