Trace a State Space Tree introduced in the Chapter 5.1 using algorithms depth_first_search checknode and expand Assume that State Space Tree is a two-level full binary tree (root is level 0). Node #2 (according to notation used in the Figure 5.1, is non-promising. Count the number of steps performed by each of those three algorithms. Consider execution of instructions like "visit node" or execution of "promising function" as one step, "write a solution" as an exit call. Note: no need to print or a draw a whole tree. Just provide three numbers as an answer Figure 5.1 A tree with nodes numbered according to a depth-first search. 10 13 16 14 15

Trace a State Space Tree introduced in the Chapter 5.1 using algorithms depth_first_search checknode and expand Assume that State Space Tree is a two-level full binary tree (root is level 0). Node #2 (according to notation used in the Figure 5.1, is non-promising. Count the number of steps performed by each of those three algorithms. Consider execution of instructions like "visit node" or execution of "promising function" as one step, "write a solution" as an exit call. Note: no need to print or a draw a whole tree. Just provide three numbers as an answer Figure 5.1 A tree with nodes numbered according to a depth-first search. 10 13 16 14 15