e. Consider wil wuuu lappen U WULU WIU Laiguu LU 1 AIL formance of the search agent and of the reflex agent vary with n? 3.21 Prove each of the following statements, or give a counterexample: a. Breadth-first search is a special case of uniform-cost search. b. Depth-first search is a special case of best-first tree search. c. Uniform-cost search is a special case of A* search. Chapter 3. Solving Prol 3.22 Compare the performance of 5. Apply A to the following graph. The heuristic estimate, h ), for node is given in the node as w/7. The cost to traverse an edge is labeled on the graph. Similarly to how it was done in class, give the fringe and closed lists and the search tree at each step of the algorithm. The start node is a. The goal node is o Start State