Artificial Intelligence class- With explanation as well.

1. ( 3 points) Consider the following graph. We need to search the following state space to find a goal. There are two goals (nodes 8 and 12). When we find a goal, we stop searching. When we have multiple nodes to visit, the priority is given to the node whose node number is less than the others. We apply BFS to find a goal. (1-1) Which goal would be found? Is this an optimal goal? (1-2) How many states are generated? (1-3) Write the order of nodes that are generated to find a goal. (1-4) How many states are evaluated? (1-5) Write the order of nodes that are evaluated to find a goal. We apply DFS to find a goal. (1-6) Which goal would be found? Is this an optimal goal? (1-7) How many states are generated? (1-8) How many states are evaluated? (1-9) How many states are deleted? (1-10) Write the order of nodes that are deleted to find a goal. 2. (1 point) We need to search the following state space to find a When b (maximum branching factor) is 8 and d (depth of the least cost solution) is 5 , (2-1) how many states are generated to find a goal with BFS in a worst case? (2-2) how many states are evaluated to find a goal with BFS in a worst case