Question is in bold.

search.py can be found at https://www.coursehero.com/u/file/50915935/F-W-G-C-Problempy

Instrument the astar_search code in search.py so that it prints out

1. the number of expanded nodes (when a node is removed from the open list and

added to the close list),

2. the number of generated nodes (when a node is created from its parent),

3. the number of duplicate nodes (when the state is already in the open list or the

closed list),

4. the solution path, and

5. the solution path length.

Tip: make change in

def best_first_graph_search(