Question 3

Key October 7, 20 asures for an agent 3. [20 points) You are given an instance of the traveling salesperson problem (TSP). A salesperson has to visit a group of cities, visiting each only once and getting back to the starting city. Assume each city is directly connected to each other city. The objective is to minimize the total distance traveled. Describe a state-space representation for the problem, specifying the initial state, goal state(s), and actions. o For a problem with N cities, how many states are there in the search space? Explain briefly your answer. 4. [20 points) This question is on properties of search algorithms. Consider the following algorithms: o depth-first