Assignment - HII CPS 4210: Artificial Intelligence -- Spring 2020 Due date: 2/28/2020 Total points - 100 . Answers should be written legibly in pen. Homework should be turned Tass on due dates. Late submission will not be accepted. If you need excuses on medical grounds or official on duty work, talk to the class teacher. Makeups will be given on above mentioned grounds with appropriate excuse letter, and makeup homework should be submitted within three weeks from the actual due date. 1. Consider the map of Romania given in Fig. 3.2. Assume the start state is Arad and the goal destination is Bucharest. (10+10+15=35 POINTS) a. Draw the BREADTH FIRST SEARCH tree b. Draw the DEPTH FIRST SEARCH tree c. Draw the DEPTH LIMITED SEARCH tree (expand to the depth 3) 2. Consider the 8-puzzle problem. The start state and end stats are given in the following: (15+15+15=45 POINTS) 1 4 1 2 3152 14 17 16 17 18 Start state End state d. Draw the BREADTH FIRST SEARCH tree e. Draw the DEPTH FIRST SEARCH tree f. Draw the DEPTH LIMITED SEARCH tree (expand to the depth 3) 3. Draw three iterations of iterative deepening search tree. Assume that branching facto b=3. Also, determine the number of nodes to be expanded by the algorithm. (20 points) Assignment - HII CPS 4210: Artificial Intelligence -- Spring 2020 Due date: 2/28/2020 Total points - 100 . Answers should be written legibly in pen. Homework should be turned Tass on due dates. Late submission will not be accepted. If you need excuses on medical grounds or official on duty work, talk to the class teacher. Makeups will be given on above mentioned grounds with appropriate excuse letter, and makeup homework should be submitted within three weeks from the actual due date. 1. Consider the map of Romania given in Fig. 3.2. Assume the start state is Arad and the goal destination is Bucharest. (10+10+15=35 POINTS) a. Draw the BREADTH FIRST SEARCH tree b. Draw the DEPTH FIRST SEARCH tree c. Draw the DEPTH LIMITED SEARCH tree (expand to the depth 3) 2. Consider the 8-puzzle problem. The start state and end stats are given in the following: (15+15+15=45 POINTS) 1 4 1 2 3152 14 17 16 17 18 Start state End state d. Draw the BREADTH FIRST SEARCH tree e. Draw the DEPTH FIRST SEARCH tree f. Draw the DEPTH LIMITED SEARCH tree (expand to the depth 3) 3. Draw three iterations of iterative deepening search tree. Assume that branching facto b=3. Also, determine the number of nodes to be expanded by the algorithm. (20 points)