C) Draw the corresponding tree showing all generated nodes when the goal state is found, for the case of d= 2 and b = 3. You can draw the tree by hand and add it as a .pdf file. (Reminder: Root is at depth 0) 1) Answer the following questions using the general Tree Search algorithm Tree Search Algorithm: function TREE-SEARCH( problem, fringe) returns a solution, or failure fringe-- INSERT(MAKE-NODE(INITIAL-STATE[problem]), fringe) loop do if fringe is empty then return failure node+ REMOVE-FRONT(fringe) if GOAL-TEST[problem] applied to STATE(node) succeeds return node fringer- INSERTALL(EXPAND(node, problem), fringe) function EXPAND( node, problem) returns a set of nodes successors -- the empty set for each action, result in SUCCESSOR-FN[problem](STATE[node]) do sta new NODE PARENT-NODE[s] node; ACTION[s] action; STATE[s] result PATH-Cost[s] PATH-Cost[node] + STEP-Cost(node, action, s) DEPTH[s] DEPTH[node] + 1 add s to successors return successors Reminder: You can use the following equality for compactness: d+1 1 + b + b + ... b = (b '-1)/(0-1) 2 d