We wish to minimize the travelling cost from the initial state to the goal state in the following graph. The numbers on the edges represent the cost of traveling from the two nodes connected by that...

Extracted text: We wish to minimize the travelling cost from the initial state to the goal state in the following graph. The numbers on the edges represent the cost of traveling from the two nodes connected by that edge State Heuristic Initial State A Goal State F A 70 146 151 99 21 50 40 A 140 B 30 R 30 80 F 40 494 R P 10 146 101 97 В P 138 For each of the following searching algorithm, name the visited nodes and the nodes of the solution path: 1) Breadth first search 2) Best-first search (use the table for the heuristic values) 3) A* search (taking the edge weights into account and that table for the heuristic values)