(10) Q2 For the below graph, draw a tree and apply a uniform cost search to find the goal? Explain all steps and show how the fringe variable will be updated in all steps. Also give time and space complexities. What will be the final path from Initial node S and the goal node (G1, G2, and G3 are goal nodes). Children will be generated based on the direction of the connection. G1 Q3 (10) (a) Explain the concept of the admissible heuristic function. b) Apply A' search for the following tree to find the best path from initial node Sto goal node Gh is the heuristic function, and g(n) is given between the nodes. B D s G 12 Q1 Answer the following briefly (Only three to four lines are enough) a) What is the difference between Acting Rationally and "Acting like a human in b) What is the difference between Static and Dynamic Environments? Give one c) What is the difference between a Learning agent and a Utility-based agent? Give d) What are the performance measures for a search algorithm? e) Describe the literative deepening search algorithm? is it better than a depth-first Search? Q2 For the below graph, draw a tree and apply a uniform cost search to find the goal? Explain all steps and show how the fringe variable will be updated in all steps. Also give time and space complexities. What will be the final path from initial node S and the goal node (G1, G2, and G3 are goal nodes). Children will be generated based on the direction of the connection. G1 Type text] Q3 (a) Explain the concept of the admissible heuristic function. (b) Apply A search for the following tree to find the best path from initial node Sto goal node G h1 is the heuristic function, and g(n) is given between the nodes. B A D A 2 6 D 3 S G