#step-costs

Question 1: Single choice

An undirected graph has the edges S–A (cost 2), S–B (6), A–C (3), B–G (9) and C–G (4). Starting at S with goal G, breadth-first search and uniform-cost search are both run as graph searches. Which paths do they return?

BFS returns S–B–G (cost 15); UCS returns S–A–C–G (cost 9)1
BFS returns S–A–C–G (cost 9); UCS returns S–B–G (cost 15)2
Both return S–A–C–G (cost 9), the cheapest path3
Both return S–B–G (cost 15), the path with the fewest edges4

Timed test