Given the following Romania Map (same as the one in the notes), complete questions (1) and (2). 1. Use the tree-search algorithm (as described in the book) with Greedy Search to find the path from Lugoj to Bucharest. Draw the search tree and show the costs for each node. Is your solution optimal? 2. Use the graph-search algorithm (as described in the book) with A Search to find the path from Timisoara to Bucharest. Draw the search tree and show the costs for each node. Is your solution optimal