Question 16
What is the time complexity of Breadth-First Search where b is the branching factor and d is the depth of the shallowest goal?
In BFS, every expanded node generates b children, yielding an exponential time complexity of O($b^d)$ at goal depth d.