Problem 2: Show all operations taken by A* search applied to the problem of getting from Timisoara to Bucharest using the straight line distance heuristic. That is, show how the priority queue changes, the states removed from the priority queue, the backpointers, etc, during a run of A* search. Also specify the path found by A* and its cost. You will need to refer to Figure 3.1 on page 64 for the graph that corresponds to the map of Romania, which shows the actual costs of transitions, etc. You will also need to refer to Figure 3.16 on page 85, which lists the straight line distances from each city to Bucharest that you will need for the heuristic (i.e., that table is the heuristic).

Problem 2: Show all operations taken by A* search applied to the problem of getting from Timisoara to Bucharest using the straight line distance heuristic. That is, show how the priority queue changes, the states removed from the priority queue, the backpointers, etc. during a run of A* search. Also specify the path found by A* and its cost. You will need to refer to Figure 3.1 on page 64 for the graph that corresponds to the map of Romania, which shows the actual costs of transitions, etc. You will also need to refer to Figure 3.16 on page 85, which lists the straight line distances from each city to Bucharest that you will need for the heuristic (i.e., that table is the heuristic). Problem 2: Show all operations taken by A* search applied to the problem of getting from Timisoara to Bucharest using the straight line distance heuristic. That is, show how the priority queue changes, the states removed from the priority queue, the backpointers, etc. during a run of A* search. Also specify the path found by A* and its cost. You will need to refer to Figure 3.1 on page 64 for the graph that corresponds to the map of Romania, which shows the actual costs of transitions, etc. You will also need to refer to Figure 3.16 on page 85, which lists the straight line distances from each city to Bucharest that you will need for the heuristic (i.e., that table is the heuristic)