1.Breadth-first 2.Best-first 3.A * Draw the generated search tree with the nodes clearly labeled. For Best-first, enter the value of the heuristic distance for each node in the tree. In the case of A *, indicate for each node of the tree, the distances d (n) and h (n) and their sum. [d (n) represents the distance actually traveled from node Start to node n; h (n) is the heuristic distance between node n and Target G - hSLD in the second figure.]

Arad is the starting point and Bucharest the end

Oradea 71 Neamt Zerind 87 75 151 Tasi Arad 140 92 Sibiu 99 Fagaras 118 Vaslui 80 Rimnicu Vilcea Timisoara 142 111 Lugoj 211 97 Pitesti 70 Hirsova Mehadia 146 101 98 Urziceni 85 138 86 75 Drobeta Bucharest 120 Craiova 90 Giurgiu Eforie Arad 366 Mehadia Bucharest 0 Neamt Craiova 160 Oradea Drobeta 242 Pitesti Eforie 161 Rimnicu Vilcea Fagaras 176 Sibiu Giurgiu 77 Timisoara Hirsova 151 Urziceni Iasi 226 Vaslui Lugoj 244 Zerind Figure 3.16 Values of hsld-straight-line distances to Bucharest. 241 234 380 100 193 253 329 80 199 374