Artificial Intelligence Class

1. (2 points) Consider the following graph. We need to search the following state space to find a goal. There are two goals (nodes 6 and 24). When we find a goal, we stop searching. When we have multiple nodes to visit, priority is given to the node whose node number is less than the othere We apply DLS-depth limit 3 to find a goal. (1-1) Which goal would be found? Is this an optimal goal? (1-2) How many nodes are generated? (1-3) Write the order of nodes that are generated to find a goal. (1-4) How many nodes are evaluated? (1-5) Write the order of nodes that are evaluated to find a goal. We apply IDS to find a goal. One state can be generated more than once. One state can be evaluated more than once. (1-6) Which goal would be found? Is this an optimal goal? (1-7) Write the order of nodes that are evaluated to find a goal. (1-8) How many nodes are evaluated? (1-9) Write the order of nodes that are generated to find a goal. (1-10) How many nodes are generated