#dfs

Question 1: Select all that apply

Which statements about uninformed search strategies are true? Assume a finite branching factor. Select all that apply.

Uniform-cost search expands nodes in order of path cost and returns a cheapest path when step costs are positive.1
Depth-limited DFS needs memory exponential in the depth limit, just like BFS.2
BFS returns a path with the fewest edges, so it is optimal when every step has the same cost.3
DFS is complete even on infinite state spaces, because it backtracks whenever a branch ends.4
Iterative deepening finds a goal with the fewest edges while using memory linear in the goal depth.5