Imagine an agent in the city of Arad, Romania, enjoying a touring holiday. The figure below shows the map of Romania. ( 20 points) Table 1: Straight-line distance to Bucharest. 1. What is the search tree from A search of finding a path from Zerind to Bucharest? Include the values of the evaluation function (f(n)=g(n)+h(n)) for each node in your search tree. Use the straight-line distance heuristic below. (Apply cycle checking to avoid cycles.)