Markup the figures attached to roughly illustrate the specified algorithms complexity. Each node (circle) in the graph represents a state in the searchs state space. Edges represent feasible transitions from one state to another. The initial state is at the top of the figure. Goal states are drawn in green and have a thicker outline (most terminal states (leaves of the trees) in these figures do not satisfy the goal test). The states that should be in the middle of the figures are omitted for space reasons. The first row of states below the void is at a depth of 16. Only three of the massive number of terminal subtrees are shown in the figures. A thick partial edge at the void in the center of the figures indicates the ancestor node for the subtree displayed below it. Assume the approximate branching factor (as illustrated by the figure) is b = 3. When there is a single value shown inside a node, n, it is the actual cost, g(n) to get from the initial node to that node.

When there are two values in a node (the A* search figures), the top value is g(n) and the bottom value is h(n), the admissible estimate of the cost to reach a goal node from the current node, n. In the circumstances when it otherwise might be considered arbitrary, assume that the algorithms process sets of child nodes left to right.

First, determine which goal state will be returned as the solution by the algorithm specified in the upper left of the figure. Circle the solution goal state (circle the circle). Determine which states would be in memory at the time the algorithm finds the solution state. Replace/overwrite the dashed outlines of states in memory with solid outlines. Strike through the text/values of every node that has been checked by the goal test. A* with h(n): 95% of the actual cost Depth 1 47 72 Depth 16/39 24 14 70 1 10 19 15 83 i. 78 ). 85 ). 88 82 ) | 89 }, 92 j. 70 r 68 ) i 62 t 65 64 i 73 89 75 i 90 i i 82 76/ 70' 68 1 : 601 77/ 71 83 i 81/ 72 178/ 60 5s i 60 62161 A* with h(n): 25% of the actual cost 15 Depth 15 12 14 10 13 18 15 Depth = 16 35 70 1 65 63 64 83 78 85 88 82) 89 92 70/68) 62 16s64 73 89 82 75 706) 60 77 71 83 818160 59 661 First, determine which goal state will be returned as the solution by the algorithm specified in the upper left of the figure. Circle the solution goal state (circle the circle). Determine which states would be in memory at the time the algorithm finds the solution state. Replace/overwrite the dashed outlines of states in memory with solid outlines. Strike through the text/values of every node that has been checked by the goal test. A* with h(n): 95% of the actual cost Depth 1 47 72 Depth 16/39 24 14 70 1 10 19 15 83 i. 78 ). 85 ). 88 82 ) | 89 }, 92 j. 70 r 68 ) i 62 t 65 64 i 73 89 75 i 90 i i 82 76/ 70' 68 1 : 601 77/ 71 83 i 81/ 72 178/ 60 5s i 60 62161 A* with h(n): 25% of the actual cost 15 Depth 15 12 14 10 13 18 15 Depth = 16 35 70 1 65 63 64 83 78 85 88 82) 89 92 70/68) 62 16s64 73 89 82 75 706) 60 77 71 83 818160 59 661