Add the concept of path cost to your implementation. Implement A*. Does it perform much better than depth-first or breadth-first search? How well does it do with the large tree you built in Exercise 4.8?

data from exercise 4.8

Explain the components of the path evaluation function f(node) used by A*. Do you think it is the best evaluation function that could be used? To what kinds of problems might it be best suited? And to what kinds of problems would it be worst suited?