Which of the following uninformed search strategies (algorithms) has the following measurements of its performance?

• It is optimal.
• It is complete.
• It has reasonable time and space complexities (particularly, O(bd) for its space complexity) where b: branching factor and d: the depth of the shallowest goal node.

This strategy (algorithm) is suitable for problems with a large search space and the unknown depth of the solution.