Problem
Consider the Search Graph and Table of Heuristic Values below.
For all problems, break ties in alphabetical order. S is the Start Node and G is the Goal Node.
The number next to each edge is the actual path cost.
Enter Nodes in order with only a space in between, for example: S SA SB.
• What is the Solution Path found by BFS?
• What is the Solution Path found by DFS?
• What is the Solution Path found by Best-First Search?
• What is the Solution Path found by A*?