Assignment 1: In this assignment, you are asked to do DFS, BFS, UCS, and A* on the map of Rumania starting from Arad and going to Bucharest. To do this, you can refer to the lectures for the last two weeks. The detail information for this task can be found in the Chapter 3 of your source book "Artificial Intelligence: A Modern Approach") which can be downloaded from blackboard and as course material. Also, you can find adequate and relevant sources in the Internet. Th e map is also provided below. Note that the information that you might need for different algorithm might be different. For example, you will and costs for A* but not for BFS. need to use the heuristic To complete this assignment, you need to trace search tree for these four algorithms and show their data flow in their related data structure (queue, priority queue, and stack) You also need to clearly demonstrate in what order you trace the tree. extended first, second, third and so forth. Please submit your answers online in blackboard. The due date is on 10/07/2018. Please make sure you are fully fluent on how to trace these algorithms. For example, you can identify which node is 15 Assignment 1: In this assignment, you are asked to do DFS, BFS, UCS, and A* on the map of Rumania starting from Arad and going to Bucharest. To do this, you can refer to the lectures for the last two weeks. The detail information for this task can be found in the Chapter 3 of your source book "Artificial Intelligence: A Modern Approach") which can be downloaded from blackboard and as course material. Also, you can find adequate and relevant sources in the Internet. Th e map is also provided below. Note that the information that you might need for different algorithm might be different. For example, you will and costs for A* but not for BFS. need to use the heuristic To complete this assignment, you need to trace search tree for these four algorithms and show their data flow in their related data structure (queue, priority queue, and stack) You also need to clearly demonstrate in what order you trace the tree. extended first, second, third and so forth. Please submit your answers online in blackboard. The due date is on 10/07/2018. Please make sure you are fully fluent on how to trace these algorithms. For example, you can identify which node is 15