Course : Artificial intelligence 1. In what order will the nodes be visited using a Breadth First Search? In what order will the nodes be visited using a Depth First Search? [2 Marks] Then, perform the step-by-step uniform cost search to reach the goal node g, whereas starting node is a. [3 Marks] 2. Explain the PEAS for a Chess playing agent [1 Marks]. Draw the tree diagram for the following figure up to Level- 4 and then apply the IDDFS algorithm using the above tree diagram, where root node is Arad [4 marks]..