Question 1: Short answer
mediumAI-checkedSearch & PlanningIn the directed graph below (link costs on the arrows) you search from A to the goal G with A* and a strict expanded list (a state is never extended twice). The heuristic is
| state | A | B | C | D | G |
|---|---|---|---|---|---|
| 3 | 6 | 4 | 3 | 0 |
What is the total cost of the path that A* returns?