Consider the 3 blocks world in which only one block can be on another block and in which the operators include: picking up a block from the table, putting a block down on the table, stacking a block on another block, and unstacking a block from another block. The complete state space for this problem is illustrated below: 15 19 (stack AC) (unstack AB) (stack AB) (unstack A C) 14 18 (pickup A) (purdown A) (pusdown A) (pickup A) A 13 17 curestack BC) (unstack CB) (stack CB) (slack BC) (stack CA) (putdown B) 16 (unstack B A) (pickup B) 10 (putdown C) (stack BC) (unstack CB) C (unstuck C Al (pickup B) ABC (putdown B) (puidown C) (stack B A) (pickup C) funstock BC) (pickup A) i (putdown A) (stack CB) (pickup C) 12 Dus D 20 22 (slack A C) BC (unstack A B) 5 a) (puzdown C) (pickup B) a (puldown B) (pickup C) 9 6 (stack B A) (stack A B) (srustack C A) (unstack A C) (stack CA) 1 (unstack BA) Notes: . . In the figure, states in this space are given arbitrary numbers as names in order to easily refer to them. When drawing search trees, number the nodes in the order they are expanded, circle these numbers to distinguish them from the numbers naming the nodes. Assume that all children of a state are shown in a search tree but that states resulting in a cycle in the resulting path from the root are eliminated as dead-end states as soon as they are generated (draw an X through them). If heuristic search is being used, next to each node generated, show the value of the evaluation function (e.g. "h=2" if just using h, or "1+2=3" for gth=f when using A*). When there is an undetermined decision (tie) regarding which node to expand next, assume nodes with lowered numbered state names are preferred (i.e. expand node 1 before node 2, etc.). Assume a goal is detected immediately when it is generated (rather than waiting until it is expanded), except for A*, where waiting to check for goal-hood until expansion is critical to guaranteeing an optimal solution (with an admissible heuristic). . Consider the problem of starting in state 5 with the goal of getting to state 17: 1. Draw the search tree resulting from depth-first search. How many nodes are expanded? In what order? (That's "expanded" not "generated"; remember "expansion" is when a node's successors are generated.) (20 points) 2. Draw the search tree resulting from breadth-first search. How many nodes are expanded? In what order? (20 points) 3. Draw the search tree resulting from best-first search using as an evaluation function the number of blocks not in the correct place as an estimate of the remaining distance to the goal. For example, the heuristic value for state 6 is 2 since blocks A and C are not in the correct place (but block B is) relative to the goal state, 18. How many nodes are expanded? In what order? (20 points) 4. Repeat problem for hill-climbing instead of best-first search. Which expands fewer nodes? Why? (20 points) 5. Draw the search tree resulting from using A* with g being the level of the node being expanded in the tree and h being the same heuristic as above and assuming tie-breaking based on node numbers (i.e. expand the node with lower number). How many nodes are expanded? In what order? (20 points)