Consider the A* search problem shown here. The path cost g(x) is the actual distance from the start state S to an intermediate state, while the heuristic h(x) is the estimated distance from an intermediate state to the goal state G. Answer the given questions. 2 points each, total 10 points] Distance (S A)-10 Distance (S ? B) = 5 Distance (S C)-8 Distance (S D)-7 Distance (SG) 25 Estimate (A ? G)-11 Estimate (B-G) 14 Estimate (09 G) = 12 Estimate (D -> G)- 15 Estimate (GG) [Obvious] 6. The function f(x) used to trace the path from start to goal in A* is a) f(x)-g(x)+h(x) cfx)hx)-gx None of these b) f(x)-g(x)-h(x) 7. Calculate f(x) for x = C: thus f (C) is: b) 20 d) 12 8. For all the intermediate states above, which state has the greatest value of f(x)? a) State A b) State B c) State C d) State D 9. Which state would A* go to, in this example, immediately after the start state? b) State B a) State A 10. If the heuristic is an underestimate, is A* complete and / or optimal? a) Only Complete c) State C d) State D b) Only Optimalc) d) Neither