2. (20 points) For this problem use the Romania map in Russell and Norvig text (figure 3.2) Suppose you are in Zerind, and your friend is in Bucharest. You two want to meet. In each turn, you both travel to a neighboring city (one cannot stay in current city and cannot start the next turn until the other friend has completed his/her part). (a) Show the state-space. (b) Given this state-space, what is the best solution in order to meet in one city with the least total travel distance? Oradea 71 Neamt Zerind151 87 75 Iasi Arad 140 92 Fagaras 118 Vaslui 80 Rimnicu Vilcea Timisoara 142 Lugoj Pitesti 21 97 70 98 Hirsova Mehadia 146 Urziceni 86 75 138 Drobeta 120 90 Craiova Eforie Giurgiu 2. (20 points) For this problem use the Romania map in Russell and Norvig text (figure 3.2) Suppose you are in Zerind, and your friend is in Bucharest. You two want to meet. In each turn, you both travel to a neighboring city (one cannot stay in current city and cannot start the next turn until the other friend has completed his/her part). (a) Show the state-space. (b) Given this state-space, what is the best solution in order to meet in one city with the least total travel distance? Oradea 71 Neamt Zerind151 87 75 Iasi Arad 140 92 Fagaras 118 Vaslui 80 Rimnicu Vilcea Timisoara 142 Lugoj Pitesti 21 97 70 98 Hirsova Mehadia 146 Urziceni 86 75 138 Drobeta 120 90 Craiova Eforie Giurgiu