3 wered Consider the following state space graph where S is the initial states and G is the goal state. The cost of each action is represented on the edges, while h represents the heuristic value of each state. Break ties with alphabetical order without elimination of repeated states, then answer the following questions accordingly: of 8.00 estion h = 1 G h=0 h = 5 B h = 7 h = 7 1. What is the returned path after implementing A* algorithm? Keep track of the frontier 2. List the nodes that have been expanded during the search with A" in the exact order in which they have been expanded. 3. What is the returned path after implementing Uniform Cost algorithm? Keep track of the frontier. 4. Are the returned paths in 1 and 2 optimal? Explain your answer 5. What are the differences between A algorithm and Uniform-Cost algorithm? do ENG 3:05 PM 3 wered Consider the following state space graph where S is the initial states and G is the goal state. The cost of each action is represented on the edges, while h represents the heuristic value of each state. Break ties with alphabetical order without elimination of repeated states, then answer the following questions accordingly: of 8.00 estion h = 1 G h=0 h = 5 B h = 7 h = 7 1. What is the returned path after implementing A* algorithm? Keep track of the frontier 2. List the nodes that have been expanded during the search with A" in the exact order in which they have been expanded. 3. What is the returned path after implementing Uniform Cost algorithm? Keep track of the frontier. 4. Are the returned paths in 1 and 2 optimal? Explain your answer 5. What are the differences between A algorithm and Uniform-Cost algorithm? do ENG 3:05 PM